#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

ll N = 998244353;

//Modded Power
ll mpow(ll a, ll n)
{
    if(n==0) return 1;

    ll x = mpow(a, n/2);
    x = (x*x)%N;

    if(n%2==0) return x;
    else return (x*a)%N;
}

//Inverse
ll inv(ll a)
{
    return mpow(a, N-2);
}

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

	ll n, k;
	cin >> k >> n;

	vector<ll> ans(n+1, 0);
	ans[0] = 1;

	for(int i=1; i<=n; i++)
    {
        ans[i] += mpow(2 * i + 1, k) - mpow(2 * i - 1, k);
        ans[i] += ans[i-1];

        for(int j=2*i; j<=n; j+=i)
        {
            ans[j] -= ans[i] - ans[i-1];
            ans[j] %= N;
        }

        ans[i] = ans[i] % N;
        if(ans[i] < 0) ans[i] += N;
    }

    /*for(ll x: ans) cout << x << " ";
    cout << "\n";*/

    cout << ans[n];
}