#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 2e7+10,LIM = 2e7,mod = 998244353;
ll addv(ll x,ll y){return (x+y>=mod)?(x+y-mod):(x+y);}
ll subv(ll x,ll y){return (x>=y)?(x-y):(x-y+mod);}
void add(ll& x,ll y){x = addv(x,y);}
void sub(ll& x,ll y){x = subv(x,y);}
//
ll mypow(ll a,ll n){
	if(!n)return 1;
	ll tmp = mypow(a,n/2); tmp = tmp*tmp%mod;
	if(n&1)tmp = tmp*a%mod; return tmp;
}
ll myinv(ll a){return mypow(a,mod-2);}
//
ll fac[MAXN],rfac[MAXN],n,m,ans;
ll C(int n,int m){
	if(n<m || m<0)return 0;
	return fac[n] * rfac[m]%mod * rfac[n-m]%mod;
}

void calc(ll v,ll w){
	if(v > m){
		(ans *= rfac[n]) %= mod;
		cout<<ans<<endl;
		exit(0);
	}
	add(ans,w * C(m-v+n,n)%mod );
}

int main(){
	fac[0] = 1; rep(i,1,LIM)fac[i] = fac[i-1] * i%mod;
	rfac[LIM] = myinv(fac[LIM]); per(i,LIM-1,0)rfac[i] = rfac[i+1] * (i+1)%mod;
	//
	cin>>n>>m; m--;

	calc(0,1);
	rep(k,1,n){
		ll w = (k&1) ? (mod-1) : (1);

		ll v = k*(3*k-1)/2;
		calc(v,w);

		v = k*(3*k+1)/2; 
		calc(v,w);
	}

    return 0;
}