k people get off a plane and walk into a hall where they are assigned to at most n queues. The number of ways in which this can be done is:

A. "Ck
B. "P
C. nik!
D. n(n+1)... (n+k – 1)