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$.