import math

mod = 998244353

M = 10**6+5
fac,ifac = [1]*M,[1]*M
for i in range(1,M):
  fac[i] = fac[i-1]*i%mod
ifac[-1] = pow(fac[-1],mod-2,mod)
for i in range(M-1,1,-1):
  ifac[i-1] = ifac[i]*i%mod
def comb(n,k):
  return fac[n]*ifac[k]*ifac[n-k]%mod
def inv(x):
  return ifac[x]*fac[x-1]%mod

def solve():
  h,w = map(int,input().split())
  n = math.gcd(h,w)
  ans = h*w
  if 4 <= n:
    ans += n*2
  if 5 <= n:
    if h*w%3 == 0:
      ans += 12*n
  if n%4 == 0:
    ans += 16
  if n%2 == 0:
    for p in range(2):
      now = 0
      for i in range(2-p,n,2):
        m = n//2-i*2
        if m < i*3 or m%3 != 0: continue
        now = (now+comb(m//3-1,i-1)*inv(i))%mod
      now *= n
      ans += now**2
  ans %= mod
  print(ans)

T = int(input())
for ti in range(T):
  solve()