{"problem":{"name":"Sequence","description":{"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$.   Output the result modulo $998244353$.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"fps_24_c"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   $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\n\n## Input\n\nThe input is given from standard input in the following format:\n\n$N$ $M$ $S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"fps_24_c","tags":[],"sample_group":[["3 2 4","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)$"],["12345 678 90123","226012779"]],"created_at":"2026-03-03 11:01:14"}}