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

#define A first
#define B second
#define SZ(x) (int)(x.size())

#define FR(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, n) FR(i, 0, n)

int M, K, coeffs[1000005];
LL MOD = 998244353;
LL modPow(LL b, LL e)
{
    if (e == 0)
        return 1;
    LL haf = modPow(b, e / 2);
    if (e % 2)
        return (((haf * haf) % MOD) * b) % MOD;
    return (haf * haf) % MOD;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> M >> K;
    FR(i, 2, K + 1)
        coeffs[i] = 1; // coeffs[i] == 1 in first loop at start of iteration iff i is prime
    int fsq = (int)(pow(K, 0.5));
    FR(i, 2, fsq + 1)
    {
        if (coeffs[i] == 1)
        {
            for (int j = i; j <= K; j += i)
                coeffs[j] *= -i;
            for (int j = i * i; j <= K; j += i * i)
                coeffs[j] = 0; // stays 0 forever
        }
    }
    FR(i, 2, K + 1)
    {
        if (coeffs[i] == -i)
            coeffs[i] = 1;
        else if (coeffs[i] == i)
            coeffs[i] = -1;
        else if (coeffs[i] < 0)
            coeffs[i] = -1;
        else if (coeffs[i] > 0)
            coeffs[i] = 1;
    }
    LL ans = 0;
    FR(i, 2, K + 1)
    {
        LL co = (modPow((K / i) * 2 + 1, M) - 1 + MOD) % MOD;
        ans = (ans + co * coeffs[i]) % MOD;
    }
    ans = (modPow(2 * K + 1, M) - ans + MOD) % MOD;
    cout << ans;
}