{"raw_statement":[{"iden":"problem statement","content":"Consider integer sequences $A=(a_1,a_2,\\dots,a_N)$ of length $N$, where each element is a non-negative integer not greater than $M$.  \nCount how many such sequences satisfy the following condition, and output the result modulo $998244353$.\n\n*   Let $B=(b_1,b_2,\\dots,b_N)$ be the sequence obtained by sorting $A$ in ascending order.  \n    For every $i$ such that $1 \\leq i \\leq N-1$, the parity of $b_i$ and $b_{i+1}$ must be different."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq M \\leq 2 \\times 10^5$\n*   $N, M$ are integers"},{"iden":"input","content":"The input is given from standard input in the following format:\n\n$N$ $M$"},{"iden":"sample input 1","content":"2 3"},{"iden":"sample output 1","content":"8\n\nThere are $8$ sequences that satisfy the condition:\n\n*   $(0,1)$\n*   $(0,3)$\n*   $(1,0)$\n*   $(1,2)$\n*   $(2,1)$\n*   $(2,3)$\n*   $(3,0)$\n*   $(3,2)$"},{"iden":"sample input 2","content":"12345 67890"},{"iden":"sample output 2","content":"761484871"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}