some enumerative problems in quantum computation are solved
and on the basis of the methods
the result is extended:There are kn balls with k different colors and the number of balls
each with same color
equals to n(balls of the some color are indistinguishable).N balls are chosen from the kn balls arbitrarily and distributed into m labeled boxes.The distributions are gotten.