P6205 [USACO06JAN] Dollar Dayz S

FJ goes to the mall to buy tools. There are $K$ kinds of tools in the mall ($1 \leq K \leq 100$), with prices $1, 2, \ldots, K$ yuan. FJ has $N$ yuan ($1 \leq N \leq 1000$) and must spend it all. How many different purchasing plans does he have?

One line with two integers $N, K$.

Output the number of different purchasing plans.

Translated by ChatGPT 5