시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 1024 MB87583.333%

문제

Grammy has a rectangular grid with $W$ vertical lines and $H$ horizontal lines. She wants to draw two non-intersecting rectangles along the grid lines. One rectangle is allowed to be completely contained inside another, but the two rectangles cannot intersect at any point, including edges and corners.

Please count the number of different rectangle drawings, modulo $998\,244\,353$. Two drawings are considered different if and only if a grid edge is colored in one of the drawings but not in the other.

입력

The only line contains two integers $W$ and $H$ ($4 \leq W,H \leq 10^9$).

출력

Output a single integer, denoting the number of different drawings modulo $998\,244\,353$.

예제 입력 1

4 5

예제 출력 1

275

예제 입력 2

723435135 239873451

예제 출력 2

832099301