import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

n, m = LI()
ans = 0

last = -1
for j in range(1, m+1):
    if j**2 > n: break
    cnt = n//j
    last = cnt
    cnt += cnt*(cnt+1)//2%md
    ans += cnt*j
    ans %= md

for c in range(last-1, 0, -1):
    l = n//(c+1)+1
    r = min(n//c, m)
    if l > r: continue
    cnt = (c+c*(c+1)//2)%md
    ans += (l+r)*(r-l+1)//2*cnt%md
    ans %= md
    if n//c > m: break

print(ans)