// qdd on Jan 30, 2023

#ifdef qdd
#include <ringo>
#else
#include <bits/stdc++.h>
#define dbg(...)
#define dbgr(x, y)
#endif

using namespace std;

using ll = long long;

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
  for (T& x : v) is >> x;
  return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  bool f = 0;
  for (const T& x : v) (f ? os << ' ' : os) << x, f = 1;
  return os;
}

const int N = 1e6 + 7;

bool vis[N];
int mu[N], prime[N];

const ll P = 998244353;

constexpr ll qk(ll a, ll b, ll p) {
  ll ans = 1 % p;
  for (a %= p; b; b >>= 1, a = a * a % p)
    if (b & 1) ans = ans * a % p;
  return ans;
}

void get_mu() {
  int tot = 0;
  mu[1] = 1;
  for (int i = 2; i < N; i++) {
    if (!vis[i]) {
      prime[tot++] = i;
      mu[i] = -1;
    }
    for (int j = 0; j < tot; j++) {
      int d = i * prime[j];
      if (d >= N) break;
      vis[d] = true;
      if (i % prime[j] == 0) {
        mu[d] = 0;
        break;
      } else
        mu[d] = -mu[i];
    }
  }
}

void sol() {
  int n, k;
  cin >> n >> k;
  ll ans = 1;
  for (int i = 1; i <= k; i++) {
    ans += mu[i] * (qk(1 + 2 * (k / i), n, P) - 1);
    ans = (ans % P + P) % P;
  }
  cout << ans << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  get_mu();
  sol();
  return 0;
}