The question is as follows. Partition an integer $n$ into $r$ distintc parts with each part ranges from $[1,m]$ and the parts order is irrelevant. How many ways of different partitions are there?
Note here it is different from the classic partition quesiton which has no restraints on ranges of each part.
Thanks.