#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=20000014;
const int mod=998244353;
ll fc[N],ifc[N];
ll ksm(ll x,ll b){
    ll rt=1;
    for(;b;b>>=1,x=x*x%mod)if(b&1)rt=rt*x%mod;
    return rt;
}
ll c(ll x,ll y){
    return fc[x]*ifc[x-y]%mod*ifc[y]%mod;
}
ll b[N];
void solve(){
    int n;
    cin>>n;
    int m;
    cin>>m;
    m--;
    ll ans=0;
    for(int i=0;i<=10000;i++){
        if(i==0){
            ans+=c(m+n,n);
        }else{
            int v=i*(i+i+i-1)/2;
            if(v<=m){
                ans+=(1-i%2*2)*c(m+n-v,n);
            }
            int w=i*(i+i+i+1)/2;
            if(w<=m){
                ans+=(1-i%2*2)*c(m+n-w,n);
            }
            ans%=mod;
        }
    }
    cout<<(ans*ifc[n]%mod+mod)%mod<<'\n';
}

signed main(){
    ios::sync_with_stdio(false);
    int T=1;
    //cin>>T;
    fc[0]=1;
    for(int i=1;i<N;i++)fc[i]=fc[i-1]*i%mod;
    ifc[N-1]=ksm(fc[N-1],mod-2);
    for(int i=N-2;~i;i--)ifc[i]=ifc[i+1]*(i+1)%mod;
    while(T--)solve();
}