#include<bits/stdc++.h>

using namespace std;

using ll = long long;
constexpr ll P = 998244353;

ll qpow(ll a, ll b) {
    ll ans = 1;
    for(; b; b/=2, a = a * a % P) {
        if(b%2==1) ans = ans * a % P;
    }
    return ans;
}

void solve() {
    ll m, k; cin >> m >> k;
    vector<ll>dp(k+1);
    vector<bool>vis(k+1);

    for(int i = 1 ; i <= k ; i ++) {
        dp[i] = qpow(2*i+1, m);
    }

    vis[1] = true;

    function<int(int)>calc = [&](int u)->int{
        if(vis[u]) return dp[u];
        for(int d = 2 ; d <= u ; ) {
            int k = u / d;
            int nxt = min(u, u/k);
            dp[u] = (dp[u] - (calc(k) - 1) * (nxt-d+1)) % P;
            d = nxt+1;
        }
        vis[u] = true;
        return dp[u];
    };
    cout << (calc(k) + P) % P << endl;
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    return 0;
}