#include <bits/stdc++.h>
using namespace std;
int P = 998244353;
int main() {
  int N, K;
  cin >> N >> K;
  if (K == 1) {
    cout << 0;
    return 0;
  }
  int f[501] = {0};
  for (int n = 1; n <= N; n++) {
    int g[501] = {0};
    g[0] = 1;
    for (int i = 1; i <= N; i++)
      for (int len = 1; len <= i && len <= n; len++)
        g[i] = (g[i] + g[i - len]) % P;
    f[n] = (g[N] - accumulate(&f[0], &f[n - 1] + 1, 0ll) % P + P) % P;
  }
  int ans = 1;
  for (int _ = 1; _ <= 2 * N - 1; _++) ans = (ans * 2) % P;
  for (int i = 1; i <= N; i++)
    for (int j = (int)ceil((double)K / i); j <= N; j++)
      ans = (ans - ((2ll * f[i] * f[j]) % P) + P) % P;
  cout << ans;
}
