#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=1000000,mod=998244353;
int m,k,mu[MAXN+5],pri[MAXN+5],tot,no[MAXN+5];
int MUL(int x,int y){
	return (long long)x*y%mod;
}
int poww(int x,int y){
	int sum=1;
	while(y){
		if(y&1){
			sum=MUL(sum,x);
		}
		x=MUL(x,x);
		y>>=1;
	}
	return sum;
}
void prep(){
	mu[1]=1;
	for(int i=2;i<=k;++i){
		if(!no[i]){
			pri[++tot]=i;
			mu[i]=-1;
		}
		for(int j=1;j<=tot;++j){
			if((long long)pri[j]*i>k){
				break;
			}
			no[pri[j]*i]=1;
			if(i%pri[j]==0){
				mu[i]=0;
				break;
			}
			mu[i*pri[j]]=-mu[i];
		}
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin>>m>>k;
	prep();
	long long ans=1;
	for(int i=1;i<=k;++i){
		ans+=MUL(poww((k/i)*2+1,m)-1,mu[i]);
		ans%=mod;
		ans+=mod;
		ans%=mod;
	}
	cout<<ans;
	return 0;
}