#include<bits/stdc++.h>
#define I using
#define love namespace
#define Elaina std
#define ll long long
I love Elaina;
const int N=10000010;
const ll mod=998244353;
ll read(){
	ll x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=(x<<3)+(x<<1)+ch-'0';
		ch=getchar();
	}
	return x*f;
}
ll n,m,fac[N<<1],ifac[N<<1],ans;
ll qp(ll x,ll p){
	ll res=1;
	while(p){
		if(p&1)res=1ll*res*x%mod;
		x=1ll*x*x%mod,p>>=1;
	}
	return res;
}
ll binom(ll n,ll m){
	if(n<m||n<0||m<0)return 0;
	return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
int main(){
	fac[0]=1;
	for(int i=1;i<=20000000;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[20000000]=qp(fac[20000000],mod-2);
	for(int i=20000000;i;i--)ifac[i-1]=1ll*ifac[i]*i%mod;
	n=read(),m=read();
	for(int i=0;i*(3*i-1)/2<m;i++){
		ans=(ans+1ll*((i&1)?mod-1:1)*binom(n+m-i*(3*i-1)/2-1,n)%mod)%mod;
		if(i&&i*(3*i+1)/2<m)ans=(ans+1ll*((i&1)?mod-1:1)*binom(n+m-i*(3*i+1)/2-1,n)%mod)%mod;
	}
	ans=1ll*ans*ifac[n]%mod;
	printf("%lld",ans);
	return 0;
}