25654번 - Melborp Lacissalc 다국어

문제

Grammy has a favorite number $k$. She thinks that all the numbers divisible by $k$ are good.

For each array containing only numbers from 0ドル$ to $k-1,ドル Grammy defines its goodness as the number of non-empty consecutive subarrays that sum to a good number.

Please count the number of arrays of length $n$ such that their goodness is $t$. Since the answer can be enormous, output the answer modulo 998ドル,244円,353円$.

입력

A single line contains three integers $n,ドル $k,ドル $t$ (1ドル \leq n, k \leq 64,ドル 0ドル \leq t \leq \frac{n(n+1)}{2}$).

출력

Output a single integer denoting the answer modulo 998ドル,244円,353円$.

제한

힌트