from math import isqrt

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

def decomp(n, m):
  for k in range(1, min(isqrt(m), n + 1)):
    yield k, k + 1, m // k
  for q in range(0, m // isqrt(m) + 1):
    l = min(n + 1, m // (q + 1) + 1)
    r = min(n + 1, m // q + 1) if q > 0 else n + 1
    yield l, r, q
    
def sum_range(l, r):
  return (l + r - 1) * (r - l) // 2
  
ans = sum(m * (r - l) - sum_range(l, r) * q for l, r, q in decomp(n, m))
print(ans % 998244353)