//Remember: (a mod m)/b IS NOT (a/b) mod m
//Checklist: multitest (!!), maxn, mod, constraints, NEGATIVE ANSWER
#include <iostream>
#include<map>
#include<set>
#include<vector>
#include<string>
#include<queue>
#include<random>
#include<stack>
#include<chrono>
using namespace std;

//#define labeltc
#define endl "\n"
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
//#define MOD 1000000007
#define MOD 998244353
#define INFLL 2000000000001000000LL
#define INFI 1001000000
#define PI ((ld)(M_PI))
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define pll pair<ll,ll>
#define plll tuple<ll,ll,ll>
#define fi first
#define sc second
#define m_p make_pair
#define p_b emplace_back
#define l_b lower_bound
#define u_b upper_bound
#define vi vector<int>
#define vl vector<ll>
#define rand_num(x,y) uniform_int_distribution<ll>((ll)x,(ll)y)(rng)
#define lsb(x) (x&(-x))
#define dgt(x) (x-'0')
#define all(x) x.begin(),x.end()
#define pans(x) ((x)? "YES " : "NO ")
template<typename T> bool ckmin(T& a, const T& b) {return (a>b)? a = b, 1 : 0;}
template<typename T> bool ckmax(T& a, const T& b) {return (a<b)? a = b, 1 : 0;}

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll power(ll x, ll e, ll m = MOD){
    ll r = 1;
    while(e>0){
        if(e%2) r = (r*x)%m;
        x = (x*x)%m;
        e >>= 1;
    }
    return r;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T,U>& v){
    os << v.fi << " " << v.sc;
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v){
    for (int i = 0; i < v.size(); ++i) {os << v[i] << " ";}
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v){
    for (auto it : v) {os << it << " ";}
    return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const map<T,U>& v){
    for (auto it : v) {os << it << "\n";}
    return os;
}
template <typename T, typename U, typename W>
ostream& operator<<(ostream& os, const tuple<T,U,W>& v){
    os << sp(get<0>(v)) << sp(get<1>(v)) << sp(get<2>(v));
    return os;
}

void setIO(string s) {
    freopen((s+".in").c_str(),"r",stdin);
    freopen((s+".out").c_str(),"w",stdout);
}

const int M = 1E6+10;

int mob[M];
vi lp(M),pr;

int n,k;


void precomp(){
    mob[1] = 1;
    for (int i=2; i<M; i++){
        if(lp[i] == 0){
            lp[i] = i;
            mob[i] = -1;
            pr.p_b(i);
        }
        for (int j=0; j < pr.size() && pr[j] <= lp[i] && 1ll*i*pr[j] < 1ll*M; j++){
            lp[i*pr[j]] = pr[j];
            if(i%pr[j] == 0) mob[i*pr[j]] = 0;
            else mob[i*pr[j]] = mob[i]*mob[pr[j]];
        }
    }
}

void solve(){
    cin >> n >> k;
    ll ans = 0;
    for (int i=1; i<=k; i++) {
        ans += power(2 * (k/i) + 1, n)*mob[i];
        ans %= MOD;
        ans = (ans+MOD)%MOD;
    }
    for (int i=1; i<M; i++) mob[i] += mob[i-1];
    ans -= mob[k];
    ans += 1;
    cout << (ans+MOD)%MOD << endl;
    ll ans2 = 0;
}

signed main(){
    //setIO();
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    precomp();
    solve();
}