#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e7+5,M=N*10+5,K=1000+5,mod=998244353,Mod=+-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,m;ll inv[N],frc[N],frv[N];
ll C(int x,int y){return x>=y&&y>=0?frc[x]*frv[y]%mod*frv[x-y]%mod:0;}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);m--;
	inv[1]=1;for(i=2;i<=2*n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(frc[0]=frv[0]=i=1;i<=2*n;i++) frc[i]=frc[i-1]*i%mod,frv[i]=frv[i-1]*inv[i]%mod;
	ll tot=C(n+m,n);
	for(i=1;i*(3*i-1)/2<=m;i++){
		tot+=(C(n+m-i*(3*i-1)/2,n)+C(n+m-i*(3*i+1)/2,n))*(i&1?-1:1);
	}
	printf("%lld\n",(tot%mod+mod)*frv[n]%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}