#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <stdio.h>

#define N_MAX 200000
#define M_MAX 200000
const int Mod = 998244353;

long long pow_mod(int n, long long k)
{
	long long N, ans = 1;
	for (N = n; k > 0; k >>= 1, N = N * N % Mod) if (k & 1) ans = ans * N % Mod;
	return ans;
}

int naive(int N, int M)
{
	int i, j, d[N_MAX + 1] = {};
	long long dp[N_MAX + 1], tmp, sum = 0;
	for (i = 2; i <= M; i++) for (j = i; j <= N; j += i) d[j]++;
	for (i = 1, dp[0] = 1; i <= N; i++) {
		for (j = 0, tmp = 0; j < i - 1; j++) tmp += dp[j] * d[i-j];
		tmp %= Mod;
		dp[i] = pow_mod(M - 1, i) - (sum + tmp) % Mod;
		if (dp[i] >= Mod) dp[i] -= Mod;
		else if (dp[i] < 0) dp[i] += Mod;
		sum = (sum * (M - 1) + tmp * (M - 2)) % Mod;
	}
	return (pow_mod(M, N) - dp[N] % Mod + Mod) % Mod;
}

int main()
{
	int N, M;
	scanf("%d %d", &N, &M);
	printf("%d\n", naive(N, M));
	fflush(stdout);
	return 0;
}