{"raw_statement":[{"iden":"problem statement","content":"Integer Sequence Exhibition is taking place, where integer sequences are gathered in one place and evaluated. Here, every integer sequence of length $N$ consisting of integers between $1$ and $K$ (inclusive) is evaluated and given an integer score between $1$ and $M$ (inclusive).\nPrint the number, modulo $998244353$, of ways to give each of the evaluated sequences a score between $1$ and $M$.\nHere, two ways are said to be different when there is an evaluated sequence $A = (A_1, A_2, \\ldots, A_N)$ that is given different scores by the two ways."},{"iden":"constraints","content":"*   $1 \\leq N, K, M \\leq 10^{18}$\n*   $N$, $K$, and $M$ are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$ $M$"},{"iden":"sample input 1","content":"2 2 2"},{"iden":"sample output 1","content":"16\n\nFour sequences are evaluated: $(1, 1)$, $(1, 2)$, $(2, 1)$, and $(2, 2)$. There are $16$ ways to give each of these sequences a score between $1$ and $2$, as follows.\n\n*   Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $1$ to $(2, 1)$, and $1$ to $(2, 2)$\n*   Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $1$ to $(2, 1)$, and $2$ to $(2, 2)$\n*   Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $2$ to $(2, 1)$, and $1$ to $(2, 2)$\n*   Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $2$ to $(2, 1)$, and $2$ to $(2, 2)$\n*   $\\cdots$\n*   Give $2$ to $(1, 1)$, $2$ to $(1, 2)$, $2$ to $(2, 1)$, and $2$ to $(2, 2)$\n\nThus, we print $16$."},{"iden":"sample input 2","content":"3 14 15926535"},{"iden":"sample output 2","content":"109718301\n\nBe sure to print the count modulo $998244353$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}