Finding Sum

You are given two integers $N$ and $M$. Find the sum of $(\sum_{i=1}^{N} |A_i-B_i|)^2$, over all pairs of arrays $A$ and $B$ such that - $A$ and $B$ consists of $N$ elements - $A_i$ and $B_i$ are integers, where $0 \leq A_i, B_i \leq M$ - $\sum_{i=1}^{N}A_i=\sum_{i=1}^{N}B_i=M$ Since the sum might be large, please print it modulo $998244353$. ### Input - The first line of input contains a singl