#include<bits/stdc++.h>
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=1e7+10,mod=998244353;
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline int Add(int x,int y){x+=y;if(x>=mod) x-=mod;return x;}
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }return sum;
}
int fac[Maxn],ifac[Maxn];
inline int C(int x,int y){if(x<y || x<0 || y<0) return 0;return 1ll*fac[x]*ifac[y]%mod*ifac[x-y]%mod;}
int n,m;
inline void into(int N){
    fac[0]=ifac[0]=1;
    fr(i,1,N) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[N]=ksm(fac[N]);
    rf(i,N-1,1) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
}
inline void init(){
    n=read();m=read();m=(m+3)/2;into(1e7);
}
inline int F1(int x) {return -2-x;}
inline int F2(int x) {return m*2-x;}
inline void change(int &x,int op){
    if(op==0) x=-2-x;
    else x=m*2-x;
}
inline bool check(int x){
    if(n+x<0 || n+x>2*n) return false;
    return true;
}
inline int sgn(int x){
    if(x==0) return mod-1;
    return 1;
}
inline int getans(int x){
    if((n+x)&1) return 0;
    if(n+x<0 || n+x>2*n) return 0;
    int i=x,op=0;
    int ans=C(n,(n+x)/2);
    while(1){
        change(i,op);
        if(!check(i)) break;
        add(ans,1ll*sgn(op)*C(n,(n+i)/2)%mod);
        op^=1;
    }
    i=x,op=1;
    while(1){
        change(i,op);
        if(!check(i)) break;
        add(ans,1ll*sgn(op^1)*C(n,(n+i)/2)%mod);
        op^=1;
    }
    return ans;
}
inline void work(){
    int ans=0;
    fr(i,0,m-1){
        add(ans,getans(i));
        // cout<<i<<' '<<ans<<endl;
    }
    writeln(ans);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}