8575: Melborp Elcissalc

链接：https://ac.nowcoder.com/acm/contest/33192/J
来源：牛客网
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−1k-1k−1, Grammy define its goodness as the number of non-empty consecutive subarrays that sums to a good number.

Please count the number of arrays of length $n$ such that its goodness is $t$. Since the answer can be enormous, output the answer modulo $998244353$.

A single line contains three integers n,k,tn,k,tn,k,t (1≤n,k≤64,0≤t≤n(n+1)21 \leq n, k \leq 64, 0 \leq t \leq \frac{n(n+1)}{2}1≤n,k≤64,0≤t≤2n(n+1)).

Output a single number, denoting the answer modulo $998244353$.

2 5 1

12