#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
const int P=998244353, maxn=300020;

int dp[maxn][800], f[2][maxn<<1];

void add(int &x, int y) {x+=y; if(x>=P) x-=P;}

int main() {
	int n, c; scanf("%d%d", &n, &c);
	int S=1; while(S*(S+1)/2<n) ++S;
	for(int i=1; i<=n; ++i) {
		for(int j=1; j<i&&j<=S; ++j) 
			dp[i][j]=(dp[i-j][j-1]+1LL*dp[i-j][j+1]*c%P)%P;
		if(i<S) dp[i][i]=1; 
	}
	int ans=0;
	for(int i=1; i<=S; ++i) add(ans, dp[n][i]);
	
	f[0][n]=1; int cur=0;
	for(int j=S; j<=n; ++j) add(ans, f[cur][n-j+n]);
	for(int j=1; j<n; ++j) if(n-j-(S+1)+n>=0) add(ans, 1LL*dp[j][S]*f[cur][n-j-(S+1)+n]%P);
	for(int i=2; i<=S; ++i, cur^=1) {
		for(int j=0; j<=2*n; ++j) {
			f[cur^1][j]=0;
			if(j-(i-1)>=0) add(f[cur^1][j], f[cur][j-(i-1)]);
			if(j+(i-1)<=2*n) add(f[cur^1][j], 1LL*f[cur][j+(i-1)]*c%P);
		}
		for(int j=S; j<=n; ++j)
			if(2*n-1LL*i*j>=0&&2*n-1LL*i*j<=2*n) add(ans, f[cur^1][n-i*j+n]);
		for(int j=1; j<n; ++j) if(n+n-j-1LL*i*(S+1)>=0) add(ans, 1LL*dp[j][S]*f[cur^1][n-j-(S+1)*i+n]%P);
	}
	printf("%d", ans);
	return 0;
}