import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
3 4
2 2
3141 5926
"""

mod=998244353
def solve(test):
  H,W=map(int, input().split())
  ans=pow(H*W,2,mod)
  if H%2==0:
    if W%2==0:
      h,w=H//2-1,W//2-1
      ans-=4*(h*(h+1)//2*w*(w+1)//2)%mod
      ans-=2*2*H*w*(w+1)//2%mod
      ans-=2*2*W*h*(h+1)//2%mod
      ans-=4*H*W%mod
    else:
      h,w=H//2-1,W//2
      ans-=4*(h*(h+1)//2*w*(w+1)//2)%mod
      ans-=2*2*H*w*(w+1)//2%mod
      ans-=2*W*h*(h+1)//2%mod
      ans-=2*H*W%mod
  else:
    if W%2==0:
      h,w=H//2,W//2-1
      ans-=4*(h*(h+1)//2*w*(w+1)//2)%mod
      ans-=2*H*w*(w+1)//2%mod
      ans-=2*2*W*h*(h+1)//2%mod
      ans-=2*H*W%mod
    else:
      h,w=H//2,W//2
      ans-=h*(h+1)//2*w*(w+1)//2%mod
      ans-=2*H*w*(w+1)//2%mod
      ans-=2*W*h*(h+1)//2%mod
      ans-=H*W%mod
  print(ans%mod)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)