#include<bits/stdc++.h>
using namespace std;
#define L long long
L MOD = 998244353ll;
L POW(L b, L p) {
  if (p == 0) return 1;
  L res = POW(b, p / 2);
  return ((res * res) % MOD * ((p&1)?b:1)) % MOD;
}


int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    L m, k;
    cin >> m >> k;
    vector<char> sieve(m+1, 0);
    vector<bool> sqr(m+1, 0);
    for (int i = 2; i <= m; i++) {
        if (!sieve[i]) {
            for (int j = i; j <= m; j += i) {
                sieve[j]++;
            }
            L s = ((L)i) * i;
            for (L j = s; j <= m; j += s) {
                sqr[j] = true;
            }
        }
    }
    L sol = 1;
    for (int i = 1; i <= k; i++) {
        if (!sqr[i]) {
            int mobius = (sieve[i]%2) ? -1 : 1;
            sol += mobius * (POW(2 * (k / i) + 1, m) - 1);
        }
    }
    cout << sol << '\n';
}