How many ways to distribute n indistinguishable balls in k distinguishable bins with the 1st bin containing at least m balls?
A) C(n-m+k-1, k-1)
B) C(n-m+k-1, k)
C) C(n-m+k, k-1)
D) C(n-m+k, k)