#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;
using namespace std;const int N=3e5+5,M=1.6e3+5,K=2e3+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,c,k,B;ll f[M][M],Ans,f1[N*2],f2[N*2];
int main(){
	int i,j;scanf("%d%d",&n,&c);k=sqrt(2*n)+10;B=2*k;
	for(i=1;i<=k;i++) f[i][i]=1;for(i=1;i<=n;i++){
		Me(f[i%B],0);if(i<=k) f[i][i]=1;
		for(j=1;j<=min(i,B);j++)f[i%B][j]=(f[i%B][j]+f[(i-j)%B][j-1]+f[(i-j)%B][j+1]*c)%mod;
	}
	for(i=1;i<=B;i++) Ans+=f[n%B][i];
	f1[n]=1;for(i=1;i<=2*n/(k+1);i++){
		for(j=k+1;j*i<=2*n;j++) Ans+=f1[2*n-j*i];
		Mc(f2,f1);Me(f1,0);
		for(j=0;j<=2*n-i;j++) f1[j]=(f1[j]+f2[j+i]*c)%mod;
		for(j=i;j<=2*n;j++) f1[j]=(f1[j]+f2[j-i])%mod;
	}
	printf("%lld\n",Ans%mod);
}