#include <bits/stdc++.h>
#define inf 1000000007
#define mod 998244353
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n,c,siz,ans;
int dp1[300005],z[300005];
int dp2[300005][805];
signed main()
{
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	read(n);read(c);dp1[0]=z[0]=1;ans=n>1;
	while(siz*(siz+1)<=2*n) ++siz;
	for(int i=1;i<=siz;++i)
		for(int j=n-siz;j>=0;--j)
		{
			dp1[j]=0;
			if(siz+i<=j) dp1[j]=dp1[j-siz-i];
			if(siz-i<=j) (dp1[j]+=1ll*dp1[j-siz+i]*c%mod)%=mod;
			if(j<n-siz&&(n-siz-j)%(i+1)==0) (ans+=dp1[j])%=mod;
			(z[j]+=dp1[j])%=mod;
		}
	for(int i=1;i<=siz;++i)
		dp2[i][i]=1;
	for(int i=1;i<=n;++i)
		for(int j=1;j<=siz&&j<i;++j)
		{
			dp2[i][j]=dp2[i-j][j-1];
			if(j<siz-1) (dp2[i][j]+=1ll*dp2[i-j][j+1]*c%mod)%=mod;
		}
	for(int i=1;i<siz;++i) (ans+=dp2[n][i])%=mod;
	for(int i=1;i<=n;++i) (ans+=1ll*dp2[i][siz]*z[n-i]%mod)%=mod;
	writeln(ans);
	return 0;
}