#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int mod=998244353,N=20000005;

int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return (ll)x*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x); return res;}

// [x^m](1-x)^-n = C(m+n-1,n-1)

int fac[N],ifac[N];

int C(int n, int m){return mul(fac[n],mul(ifac[m],ifac[n-m]));}

void ahcorz(){
    fac[0]=1;
    for(int i=1; i<N; ++i) fac[i]=mul(fac[i-1],i);
    ifac[N-1]=Pow(fac[N-1]);
    for(int i=N-2; i>=0; --i) ifac[i]=mul(ifac[i+1],i+1);
    // [x^m-1](1-x)(1-x^2)(1-x^3)...(1-x^n)(1-x)^(-(n+1))
    int n,m; cin >> n >> m;
    int res=C(m+n-1,n);
    for(int i=1; ; ++i){
        if(i*(3*i-1)/2>m-1) break;
        if(i&1) res=sub(res,C(m+n-1-i*(3*i-1)/2,n));
        else res=add(res,C(m+n-1-i*(3*i-1)/2,n));
        if(i*(3*i+1)/2>m-1) break;
        if(i&1) res=sub(res,C(m+n-1-i*(3*i+1)/2,n));
        else res=add(res,C(m+n-1-i*(3*i+1)/2,n));
    }
    res=mul(res,ifac[n]);
    cout << res << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t=1;// cin >> t;
    while(t--){
        ahcorz();
    }
}