You are given K different boxes and N different balls? In how many ways can one distribute the balls so that no box is empty?
I think I can start off by putting 1 ball into each box so I get n-k balls left. K out of the N balls can be put in the boxes in n!/(n-k)! ways and that's the farthest I got. I don't know how to proceed. Any help appreciated.