#include<iostream>
#include<cstdio>
#include<cmath>
#define M 2000
#define N 400000
#define mod 998244353
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,w,op,Base,Base2,F[M+1],dp[2][N+1],dp2[M+1][M+1],ans;
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
int main()
{
    int st;
    n=read(),w=read(),Base=sqrt(2*n),Base2=sqrt(2*n)+sqrt(n),dp[0][0]=1;
    //st>Base
    for (int i=0;i<=Base;++i) F[i]=(i*(i+1))>>1;
    for (int i=1;i<=Base;++i)
    {
	for (int j=Base+1;j<=n;++j)
	{
	    st=n-i*j+F[i-1];
	    if ((!(st&1))&&st>=0&&(st>>1)<=F[i-1]) Adder(ans,dp[op][st>>1]);
	}
	op^=1;
	for (int j=0;j<=F[i];++j) dp[op][j]=0;
	for (int j=0;j<=F[i];++j) Adder(dp[op][j],1ll*dp[!op][j]*w%mod);
	for (int j=i;j<=F[i];++j) Adder(dp[op][j],dp[!op][j-i]);
    }
    //st<=Base
    op=0;
    for (int i=1;i<=n;++i)
    {
	op=(op+1)%(Base2+1);
	for (int j=1;j<=min(i,Base2);++j) dp2[op][j]=0;
	if (i<=Base) Adder(dp2[op][i],1);
	for (int j=2;j<=min(i,Base2);++j) Adder(dp2[op][j],dp2[(op+Base2+1-j)%(Base2+1)][j-1]);
	for (int j=1;j<=min(i,Base2-1);++j) Adder(dp2[op][j],1ll*dp2[(op+Base2+1-j)%(Base2+1)][j+1]*w%mod);
    }
    for (int i=1;i<=min(n,Base2);++i) Adder(ans,dp2[op][i]);
    printf("%d\n",ans);
    return 0;
}