You are given $N$ different balls and $M$ different boxes. In how many ways can one distribute the balls so that no box is empty?
I've found it hard to answer, I've listed a few cases, but it seems to be much more complicated when $M$ is getting bigger. I don't know how to proceed. Any help appreciated.