9470: 相

Find the number of labeled trees that satisfy the following conditions: 1\. $n$ vertices. 2\. Each vertex has a degree less than or equal to $d$. 3\. There exists a path that includes nodes $1, 2, 3, \cdots, k$. Note that this path may also include other nodes. Output the result modulo $998244353$.

The first line contains three positive integers $n, d, k$.

Output one integer, which is the answer modulo $998244353$.

##### 输入样例2 ``` 10 3 4 ``` ##### 输出样例2 ``` 33957360 ``` ##### 备注： $1 \leq d < n \leq 500, 1 \leq k \leq n \leq 500$.