// Problem: # 8171. Cola
// URL: https://qoj.ac/problem/8171
// Memory Limit: 1024 MB
// Time Limit: 1000 ms

#include<bits/stdc++.h>
#define debug(x) cerr<<(#x)<<" "<<(x)<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe; 
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*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=2e7+9,Mod=998244353;
ll n,m,fac[N],ifac[N],ans;
ll pw(ll x,ll p){
	ll res=1;
	while(p){
		if(p&1)res=res*x%Mod;
		x=x*x%Mod;
		p>>=1;
	}
	return res;
}
ll C(ll x,ll y){
	if(x<y||y<0)return 0;
	return fac[x]*ifac[y]%Mod*ifac[x-y]%Mod;
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read(),m=read();
	fac[0]=1;
	rep(i,1,n+m)fac[i]=fac[i-1]*i%Mod;
	ifac[n+m]=pw(fac[n+m],Mod-2);
	per(i,n+m-1,0)ifac[i]=ifac[i+1]*(i+1)%Mod;
	rep(i,0,m){
		if(i*(3*i-1)/2>m)break;
		ll co=(!(i&1))?1:Mod-1;
		ans=(ans+co*C(n+m-1-i*(3*i-1)/2,n))%Mod;
		if(i&&i*(3*i+1)/2<m)ans=(ans+co*C(n+m-1-i*(3*i+1)/2,n))%Mod;
	}
	write(ans*ifac[n]%Mod);
	return 0;
}