The wording implies that we can treat the parts as identical and the boxes different,

We can put N identical objects into K distinct cells in ways.

If we want the number of ways in which no cell is empty then the answer is .

For this question divide the second by the first and subtract that from 1.