#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int N=20000010,P=998244353;
int n,m,ifac[20000005],fac[20000005];
int qmi(int a,int b){
	int res=1;
	while(b){
		if(b&1)res=res*a%P;
		a=a*a%P;
		b>>=1;
	}
	return res;
}
int C(int x,int y){ if(y<0||x<y) return 0;return 1ll*fac[x]*ifac[y]%P*ifac[x-y]%P;}
struct tree{
	int l,r,sum,flag;
}tr[400005];
void pushup(int u){
	tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum;
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m,m--;
    fac[0]=1;
	for(int i=1;i<=n+m;i++)fac[i]=1ll*fac[i-1]*i%P;
    ifac[n+m]=qmi(fac[n+m],P-2);
    for(int i=n+m-1;~i;i--)ifac[i]=1ll*ifac[i+1]*(i+1)%P;
    int ans=C(n+m,n);
    for(int k=1;(3*k*k-k)/2<=m;k++){
        int v=C(n+m-(3*k*k-k)/2,n)+C(n+m-(3*k*k+k)/2,n);
        if(k&1) ans=(ans-1ll*v)%P;
        else ans=(ans+1ll*v)%P;
    }
    ans=1ll*ans*ifac[n]%P;
    cout<<(ans+P)%P;
    return 0;
}