import math
mod = 998244353

n, m = map(int, input().split())

ans = 0
for i in range(1, n + 1):
    for j in range(1, m + 1):
        ans += i * j // math.gcd(i, j)
        
print(ans % mod)