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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << "\n";
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int mod = 998244353;
int add(int a, int b) {
  return a + b >= mod ? a + b - mod : a + b;
}
int sub(int a, int b) {
  return a - b < 0 ? a - b + mod : a - b;
}
int mul(int64_t a, int64_t b) {
  return static_cast<int>(a * b % mod);
}

int modpow(int e, int p) {
  int r = 1;
  while (p) {
    if (p & 1) r = mul(r, e);
    e = mul(e, e);
    p >>= 1;
  }
  return r;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int m, k;
  cin >> m >> k;

  vector<int> mu(k + 1), sieve(k + 1), primes;

  mu[1] = 1;
  for (int i = 2; i <= k; i++) {
    if (!sieve[i]) {
      primes.push_back(i);
      mu[i] = mod - 1;
    }

    for (int p : primes) {
      if (i * p > k) break;
      sieve[i * p] = true;
      if (i % p == 0) {
        mu[i * p] = sub(0, mu[i]);
        break;
      } else {
        mu[i * p] = 0;
      }
    }
  }

  int ans = 1;
  for (int i = 1; i <= k; i++) {
    const int C = k / i * 2 + 1;
    ans = add(ans, mul(mu[i], sub(modpow(C, m), 1)));
  }
  cout << ans << '\n';

  return 0;
}