#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
main() {
	int n, k;
	ll ans = 0;
	cin >> n >> k;
	vector<ll> anss;
	for (int i = 0; i <= n; ++i) {
		int dp[i + 1]{1};
		for (int j = 1; j <= i; ++j) for (int ii = 1; ii <= i; ++ii) if (j >= ii) (dp[j] += dp[j - ii]) %= mod;
		anss.push_back(dp[i]);
	}
	for (int i = 1; i <= n; ++i)
		ans += (anss[i] - anss[i - 1]) * anss[min(n, (k - 1) / i)] % mod * 2 % mod;
	ans %= mod;
	if (ans < 0) ans += mod;
	cout << ans;
}