N,M=map(int,input().split())
if M>1e7:exit()
piyo=[1]*(M+1)
hoge=list(range(M+1))

for p in range(2,M+1):
  if hoge[p]==p:
    for i in range(p,M+1,p):
      neko=0
      while hoge[i]%p==0:
        hoge[i]//=p
        neko+=1
      piyo[i]*=neko+1

print(sum(pow(nyaa,N,998244353) for nyaa in piyo[1:])%998244353)