#include <bits/stdc++.h>

using namespace std;

using ll = long long;
constexpr ll P = 998244353;

inline ll qpow(ll a, ll b)
{
	ll ans = 1;
	for (; b; b /= 2, a = a * a % P) {
		if (b % 2 == 1)
			ans = ans * a % P;
	}
	return ans;
}
ll dp[1000010];
void solve()
{
	ll m, k;
	cin >> m >> k;

	for (int i = 1; i <= k; i++) {
		dp[i] = qpow(2 * i + 1, m);
	}

	for (int i = 1; i <= k; i++) {
		for (int d = 2; d <= i;) {
			int k = i / d;
			int nxt = min(i, i / k);
			dp[i] = (dp[i] - (dp[k] - 1) * (nxt - d + 1)) % P;
			d = nxt + 1;
		}
	}

	cout << (dp[k] + P) % P << endl;
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	solve();

	return 0;
}