#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 998244353;
int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}
int mult(int a, int b)
{
	return (LL)a * b % mod;
}
int binpow(int a, int n)
{
	int res = 1;
	while(n)
	{
		if(n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}
const int N = 1.1e7;
int fact[N], ifact[N];
void init()
{
	fact[0] = 1;
	FOR(i, 1, N)
		fact[i] = mult(fact[i - 1], i);
	ifact[N - 1] = binpow(fact[N - 1], mod - 2);
	RFOR(i, N, 1)
		ifact[i - 1] = mult(ifact[i], i);
}
int C(int n, int k)
{
	if(k < 0 || k > n)
		return 0;
	return mult(fact[n], mult(ifact[k], ifact[n - k]));
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	init();

	int n, m;
	cin >> n >> m;
	m = (m + 1) / 2;
	
	int ans = 0;
	
	int l1 = -1, l2 = m + 1;
	int len = l2 - l1;
	int mo = 2 * len;
	
	FOR(i, 0, n + 1)
	{
		int h = i - (n - i);
		int val = C(n, i);
		
		h = (h % mo + mo) % mo;
		
		if(h == mo - 1 || h == l2)
			continue;
		
		if(h < l2)
			ans = add(ans, val);
		else
			ans = sub(ans, val);
	}	
	cout << ans << "\n";
	
	
	return 0;
}