A group of friends decided to distribute some money among themselves. They have a total of dollars in -dollar bills. The group consists of K + 1 people.
Each person can receive any amount of money (including ), but the bills cannot be torn. Determine how many different ways the money can be distributed among all participants.
The input file contains two integers: (0 \leq X \leq 500) and (0 \leq K \leq 100). It is given that is divisible by . Additionally, tearing the bills is not allowed during the division.
Output a single integer representing the number of ways to divide the money.
Example 1