#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5,B = 780,P = 998244353;
inline void Plus(int &x,const int &y) { x += y;if(x >= P) x -= P;}
int dp[B * 2 + 5][B * 2 + 5];
int n,c;
inline int Solve1() {
	for(int i = 1;i < B;i++) 
		dp[i][i] = 1;
	int mod = B * 2 + 5;
	for(int i = 1;i < n;i++) {
		for(int j = 1;j <= B * 2;j++) {
			int now = i % mod,nxt = (i + j + 1) % mod,val = dp[now][j];
			dp[now][j] = 0;if(!val) continue;
			Plus(dp[nxt][j + 1],val);
			nxt = (i + j - 1) % mod;
			if(j != 1) nxt = (i + j - 1) % mod,Plus(dp[nxt][j - 1],1ll * c * val % P);
		}
	}
	int ans = 0;
	for(int i = 1;i <= 2 * B;i++) Plus(ans,dp[n % mod][i]);
	return ans;
}
int f[2][N << 1];
inline int Solve2() {
	f[0][N] = 1;
	int ans = 0;
	for(int i = 1;i <= B;i++) {
		int lim = i * (i - 1) / 2;
		for(int j = N - lim;j <= N + lim;j++) f[i&1][j] = 0;
		for(int j = N - lim;j <= N + lim;j++) {
			if(i > 1) Plus(f[i&1][j - (i - 1)],1ll * f[(i-1)&1][j] * c % P);
			Plus(f[i&1][j + (i - 1)],f[(i-1)&1][j]);
		}
		for(int j = B;j <= n;j++) { // 枚举 a[1]
			int tmp = n - i * j;
			if(abs(tmp) <= lim) Plus(ans,f[i&1][tmp + N]);
		}
	}
	return ans;
}
int main() {
	cin >> n >> c;
	int ans = Solve1();
	Plus(ans,Solve2());
	cout << ans << endl;
	return 0;
}