#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=998244353;
const int N=2e7+5;
ll n,m;
ll p[N],q[N];
ll inf[2*N],f[2*N];
ll pw(ll x,ll y){
	if(y==0) return 1;
	if(y%2) return x*pw(x,y-1)%mod;
	ll res=pw(x,y/2);
	return res*res%mod;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin >> n >> m;
	f[0]=1;
	for(int i=1; i<=n+m ;i++) f[i]=f[i-1]*i%mod;
	inf[n+m]=pw(f[n+m],mod-2);
	for(int i=n+m; i>=1 ;i--) inf[i-1]=inf[i]*i%mod;
	p[0]=1;
	for(ll k=1; k<=n ;k++){
		ll v=(k%2?mod-1:1);
		if(k*(3*k-1)/2<m){
			p[k*(3*k-1)/2]+=v;
		}
		if(k*(3*k+1)/2<m){
			p[k*(3*k+1)/2]+=v;
		}
	}
	ll sum=0;
	ll ans=0;
	/*for(int k=0; k<=m-1 ;k++) cout << p[k] << ' ';
	cout << endl;*/
	for(ll k=m-1; k>=0 ;k--){
		sum=(sum+p[m-1-k])%mod;
		ans=(ans+f[n+k-1]*inf[n-1]%mod*inf[k]%mod*sum)%mod;
	}
	ans=ans*inf[n]%mod;
	cout << ans << '\n';
}