#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool memBeg;
constexpr int mod=998244353;
constexpr int inv2=(mod+1)/2;
constexpr int inv3=(mod+1)/3;
constexpr int inv6=(mod+1)/6;
void inc(int &x,int y) {x+=y; x-=(x>=mod)*mod;}
void dec(int &x,int y) {x-=y; x+=(x<0)*mod;}
constexpr int add(int x,int y) {return (x+y>=mod)?x+y-mod:x+y;}
constexpr int sub(int x,int y) {return (x<y)?x-y+mod:x-y;}
constexpr int quick_pow(int x,int times) {
    int ret=1;
    for(;times;times>>=1,x=1ll*x*x%mod) {
        if(times&1) ret=1ll*ret*x%mod;
    }
    return ret;
}
constexpr int maxn=2e7+5;
int n,m,fac[maxn],ifac[maxn];
int binom(int x,int y) {
    if(x<0||y<0||x<y) return 0;
    return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;
}
int calc(int s) {
    if(s>=m) return 0;
    // printf("calc(s = %d) = %d\n",s,binom(m-s-1+n,n));
    return binom(m-s-1+n,n);
}
bool memEn;
void fl() {
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
int main() {
    fprintf(stderr,"%.24lf\n",fabs(&memEn-&memBeg)/1024.0/1024.0);
    // fl();
    scanf("%d%d",&n,&m);
    fac[0]=1;
    for(int i=1;i<maxn;i++) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[maxn-1]=quick_pow(fac[maxn-1],mod-2);
    for(int i=maxn-2;i>=0;i--) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
    int ret=0;
    for(int i=-10000;i<=10000;i++) {
        int now=calc((3*i*i-i)/2);
        if(i&1) dec(ret,now);
        else inc(ret,now);
    }
    ret=1ll*ret*ifac[n]%mod;
    printf("%d\n",ret);
    return 0;
}