# 入力を受け取る
M, N = map(int, input().split())
MOD = 998244353
# 「増加分」を保持する配列
diff = [M] * (N + 1)

for i in range(1, M + 1):
    # iの倍数は増加分に-iの寄与をもたらす
    for j in range(0, N + 1, i):
        diff[j] -= i

# sum(x mod i) の計算
res = [0] * (N + 1)
for x in range(N):
    res[x + 1] = (res[x] + diff[x + 1]) % MOD
print(res[-1])
# print(max(res))