# include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
typedef long long ll;
int prime[2000010],mu[2000010],pw[2000010],tot;
bool ispri[2000010];
ll power(ll a,int b)
{
	ll ans=1;
	for(;b;b>>=1,a=a*a%mod)
		if(b&1) ans=ans*a%mod;
	return ans;
}
int main()
{
	int m,k,ans=1;
	cin>>m>>k;
	memset(ispri,true,sizeof(ispri));
	ispri[0]=ispri[1]=0;mu[1]=pw[1]=1;
	for(int i=2;i<=2*k+1;i++)
	{
		if(ispri[i]) prime[++tot]=i,mu[i]=-1,pw[i]=power(i,m);
		for(int j=1;j<=tot && i*prime[j]<=2*k+1;j++)
		{
			ispri[i*prime[j]]=0;
			pw[i*prime[j]]=(ll)pw[i]*pw[prime[j]]%mod;
			if(i%prime[j]) mu[i*prime[j]]=-mu[i];
			else break;
		}
	}
	for(int i=1;i<=k;i++)
		if(mu[i]) ans=(ans+(mu[i]>0?pw[2*(k/i)+1]-1:mod-pw[2*(k/i)+1]+1))%mod;
	cout<<ans<<endl;
	return 0;
}