#include<bits/stdc++.h>
#define MULT_TEST 0
#define int long long
using namespace std;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
inline int read() {
	int w = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		w = (w << 1) + (w << 3) + ch - 48;
		ch = getchar();
	}
	return w * f;
}
inline int Pow(int a, int b){
	int ans = 1;
	for(; b; b >>= 1){
		if(b & 1) ans = ans * a % MOD;
		a = a * a % MOD;
	}
	return ans;
}
inline void Solve() {
	int m, k, ans = 1;
	m = read(); k = read();
	vector<int> prime, mu(k + 1);
	vector<bool> vis(k + 1);
	mu[1] = 1;
	for (int i = 2; i <= k; i++) {
		if (!vis[i]) {
			prime.push_back(i);
			mu[i] = -1;
		}
		for (auto p : prime) {
			if (i * p > k) break;
			vis[i * p] = 1;
			if (i % p == 0) break;
			mu[p * i] = -mu[i];
		}
	}
	for (int i = 1; i <= k; i++) {
		ans += mu[i] * (Pow(2 * (k / i) % MOD + 1, m) - 1 + MOD) % MOD;
		ans = (ans % MOD + MOD) % MOD;
	}
	printf("%lld\n", ans);
}
signed main() {
	int T = 1;
#if MULT_TEST
	T = read();
#endif 
	while (T--) Solve();
	return 0;
}