#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod=998244353;
ll ksm(ll a,ll x){
	ll ret=1;
	for (;x;x>>=1,a=a*a%mod) if (x&1) ret=ret*a%mod;
	return ret;	
}
ll inv(ll a){return ksm(a,mod-2);}

const int maxn=1000000;
bool notp[maxn+50];
int pcnt=0;
ll p[(maxn>>2)+50];
ll mu[maxn+50];

void prepare(){
	notp[1]=1;
	mu[1]=1;
	for (int i=2;i<=maxn;i++){
		if (!notp[i]){
			p[++pcnt]=i;
			mu[i]=mod-1;
		}
		for (int j=1,x=1;j<=pcnt && (x=i*p[j])<=maxn;j++){
			notp[x]=1;
			if (i%p[j]){
				mu[x]=mod-mu[i];
			}
			else{
				mu[x]=0;
				break;	
			}
		}
	}
//	for (int i=1;i<=maxn;i++) assert(0<=mu[i] && mu[i]<=mod);
}

int main(){
	ios_base::sync_with_stdio(false);
	prepare();
	/*
	for (int i=1;i<=20;i++) cerr << p[i] << " ";
	cerr << endl;
	for (int i=1;i<=20;i++) cerr << mu[i] << " ";
	cerr << endl;
	*/
	ll m,k;
	cin >> m >> k;
	
	ll ans=1;
	for (ll i=1;i<=k;i++){
		ans=(ans+mu[i]*(ksm(k/i*2+1,m)+mod-1))%mod;
	}
//	ans=(ans+mod-1)*ksm(2,m)%mod;
//	ans=(ans+ksm(3,m))%mod;
	cout << ans << "\n";
	return 0;	
}