#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int M = 998244353;

int qpw(int a, int b) {
	a %= M;
	if (b < 0) {
		(b %= M - 1) += M - 1;
	}
	int c = 1;
	for (; b; b >>= 1, a = 1ll * a * a % M) {
		if (b & 1) {
			c = 1ll * c * a % M;
		}
	}
	return c;
}

int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int n, k;
	cin >> n >> k;
	vector<int> vis(k + 1), mu(k + 1), pri;
	mu[1] = 1;
	for (int i = 2; i <= k; i++) {
		if (!vis[i]) {
			pri.emplace_back(i);
			mu[i] = -1;
		}
		for (auto p : pri) {
			if (1ll * i * p > k) {
				break;
			}
			vis[i * p] = true;
			if (i % p == 0) {
				break;
			}
			mu[i * p] = -mu[i];
		}
	}
	int ans = 1;
	for (int i = 1; i <= k; i++) {
		ans = (ans + 1ll * mu[i] * (qpw(k / i * 2 + 1, n) - 1)) % M;
	}
	cout << (ans % M + M) % M << '\n';
	return 0;
}