#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

const int MAXC = 1000000;
const int MOD = 998244353;

void add(int &x, int val) {
    x += val;
    if (x >= MOD) x -= MOD;
}

int pw(int a, int n) {
    int res = 1;
    for (; n; n >>= 1, a = (ll)a * a % MOD)
        if (n & 1)
            res = (ll)res * a % MOD;
    return res;
}

int mu[MAXC + 1], prime[MAXC + 1];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    mu[1] = 1;
    for (int i = 2; i <= MAXC; ++i) {
        if (!prime[i]) { 
            prime[i] = i;
            for (int j = i + i; j <= MAXC; j += i)
                prime[j] = i;
        }
        if (i / prime[i] % prime[i] != 0) 
            mu[i] = -mu[i / prime[i]]; 
    }
    int m, k;
    cin >> m >> k;
    int ans = 0;
    for (int d = 1; d <= k; ++d) {
        int num = pw(2 * (k / d) + 1, m);
        add(num, MOD - 1);
        if (mu[d] == 1) add(ans, num);
        else if (mu[d] == -1) add(ans, MOD - num);
    }
    add(ans, 1);
    cout << ans << "\n";
}