Finally, Non Ad-Hoc Problem

You are given two integers $A$ and $N$. Calculate number of permutations $p$ of length $N$ such that $i - N + A < p_i < i + A$ for $1 \le i \le N$. Since this number can be very large, calculate it modulo $998244353$. ### Input The only line of the input contains two integers $N$, $A$. ### Output Output the number of permutations modulo $998244353$. ### Constraints - $2 \le N \le 10^9$ - $1 \l