How many are good?#3686
Given integers , , and , your task is to find the number of "good" solutions to the equation X_1 + \cdots + X_N = M. A solution is considered "good" if each variable X_i is an integer that satisfies the condition: 0 \leq X_i \leq K for all 1 \leq i \leq N. The result should be presented modulo .
The input consists of a single line containing the integers , , and where 1 \leq N \leq 35, 1 \leq M \leq 25, and 1 \leq K \leq 12.
The output should be a single integer representing the number of "good" solutions to the problem.
Example 1