#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


const int maxn=2e7+10;

int fact[maxn],inv[maxn];
int nCk(int n,int k){
    if(n<0 || k<0 || n<k)return 0;
    return mul(fact[n],mul(inv[k],inv[n-k]));
}

int n,m;
int get_coef(int m){
    return nCk(n+m,n);
}

int main(){

    ///freopen("test.txt","r",stdin);

    fact[0]=1;
    for(int i=1;i<maxn;i++)fact[i]=mul(fact[i-1],i);
    inv[maxn-1]=invv(fact[maxn-1]);
    for(int i=maxn-1;i>0;i--)inv[i-1]=mul(inv[i],i);

    scanf("%d %d",&n,&m);
    m--;

    int rez=get_coef(m);
    for(int k=1;;k++){
        int coef=(k*(3*k+1))/2;
        ///printf("%d %d \n",coef,m);
        if( coef>m )break;

        int c=1;
        if(k%2)c=mod-1;
        ///printf("AAA\n");
        rez=add(rez,mul(c,get_coef(m-coef)));
    }
    for(int k=1;;k++){
        int coef=(k*(3*k-1))/2;
        if( coef>m )break;

        int c=1;
        if(k%2)c=mod-1;
        ///printf("AAA\n");
        rez=add(rez,mul(c,get_coef(m-coef)));
    }

    printf("%d\n",mul(rez,inv[n]));

    return 0;
}