{"raw_statement":[{"iden":"problem statement","content":"Among integer sequences of length $N$ consisting of non-negative integers not greater than $M$, find the number of sequences whose total sum is exactly $S$.  \nOutput the result modulo $998244353$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq M \\leq 2 \\times 10^5$\n*   $1 \\leq S \\leq 2 \\times 10^5$\n*   $N, M, S$ are integers"},{"iden":"input","content":"The input is given from standard input in the following format:\n\n$N$ $M$ $S$"},{"iden":"sample input 1","content":"3 2 4"},{"iden":"sample output 1","content":"6\n\nThere are $6$ sequences that satisfy the condition:\n\n*   $(0,2,2)$\n*   $(1,1,2)$\n*   $(1,2,1)$\n*   $(2,0,2)$\n*   $(2,1,1)$\n*   $(2,2,0)$"},{"iden":"sample input 2","content":"12345 678 90123"},{"iden":"sample output 2","content":"226012779"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}