K,N=map(int,input().split())
D=[[] for n in range(N+1)]
for d in range(1,N+1):
    for n in range(2*d,N+1,d):
        D[n].append(d)
mod=998244353
dp=[0]*(N+1)
for n in range(1,N+1):
    dp[n]=pow(2,n,mod)
    if K>1:
        dp[n]+=1
    for d in D[n]:
        dp[n]-=dp[d]
        dp[n]%=mod
ans=dp[N]
print(ans)