{"raw_statement":[{"iden":"problem statement","content":"You are given an **odd** number $N$ and a non-negative integer $K$.\nFind the number, modulo $998244353$, of sequences of integer pairs $((L_1,R_1),(L_2,R_2),\\dots,(L_N,R_N))$ satisfying all of the following conditions.\n\n*   $(L_1,R_1,L_2,R_2,\\dots,L_N,R_N)$ is a permutation of the integers from $1$ to $2N$.\n*   $L_1 \\leq L_2 \\leq \\dots \\leq L_N$.\n*   $L_i \\leq R_i \\ (1 \\leq i \\leq N)$.\n*   There are exactly $K$ indices $i\\ (1\\leq i \\leq N)$ such that $L_i+1=R_i$.\n*   There is a rooted binary tree $T$ with $N$ vertices numbered from $1$ to $N$ such that the following holds:\n    *   vertices $i$ and $j$ have an ancestor-descendant relationship in $T$ $\\iff$ intervals $[L_i,R_i]$ and $[L_j,R_j]$ intersect.\n\nHere, a rooted binary tree is a rooted tree where each vertex has $0$ or $2$ children. Vertices $i$ and $j$ are said to have an ancestor-descendant relationship in a tree $T$ if either vertex $j$ exists on the simple path connecting the root to vertex $i$, or vice versa."},{"iden":"constraints","content":"*   $1 \\leq N < 2 \\times 10^5$\n*   $0 \\leq K \\leq N$\n*   $N$ is odd.\n*   All input values are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"3 1"},{"iden":"sample output 1","content":"2\n\nFor example, if $(L_1,R_1)=(1,5),(L_2,R_2)=(2,3),(L_3,R_3)=(4,6)$, then $i=2$ is the only pair with $L_i+1=R_i$. Also, the fifth condition is satisfied by a tree where vertex $1$ is the root, and its children are vertices $2$ and $3$."},{"iden":"sample input 2","content":"1 0"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"521 400"},{"iden":"sample output 3","content":"0"},{"iden":"sample input 4","content":"199999 2023"},{"iden":"sample output 4","content":"283903125"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}