MOD=998244353

k,n=(int(x) for x in input().split())

ans=[1]*(n+1)
for i in range(1,n+1):
    ans[i]=ans[i-1]*2
    ans[i]%=MOD

prime=[True]*(n+1)
prime[0]=False
prime[1]=False
for i in range(2,n+1):
    if prime[i]:
        for j in reversed(range(1,n//i+1)):
            prime[i*j]=(j==1)
            ans[i*j]-=ans[j]
            ans[i*j]%=MOD
if k!=1 and n==1:
    print(ans[n]+1)
else:
    print(ans[n])