#include <bits/stdc++.h>
using namespace std;
const long long maxn = 507, mod = 998244353;
long long n, k, a[maxn], dp[maxn], sum[maxn], ans;
void solve() {
  cin >> n >> k;
  for (long long i = 1; i <= n; ++i) {
    memset(dp, 0, sizeof(dp));
    memset(sum, 0, sizeof(sum));
    dp[0] = 1, sum[1] = 1;
    for (long long j = 1; j <= n; ++j) {
      dp[j] = (sum[j] - sum[(j - i >= 0 ? j - i : 0)]) % mod;
      sum[j + 1] = (sum[j] + dp[j]) % mod;
    }
    a[i] = dp[n];
  }
  for (long long i = 1; i <= n; ++i) {
    ans += (((a[i] - a[i - 1]) % mod) * a[min(n, (k - 1) / i)]) % mod,
        ans %= mod;
  }
  ans *= 2, ans %= mod;
  cout << ans << '\n';
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
