#include <bits/stdc++.h>
constexpr int P = 998'244'353;
int dp1[505][1005];
int dp2[505];
int main() {
  int n, k;
  std::cin >> n >> k;
  dp1[0][0] = 2;
  for (int filled = 0; filled < n; ++filled) {
    for (int max_so_far = 0; max_so_far <= std::min(n, k - 1); ++max_so_far) {
      for (int fill = 1; fill <= std::min(n, k - 1) && filled + fill <= n; ++fill) {
        (dp1[filled + fill][std::max(max_so_far, fill)] += dp1[filled][max_so_far]) %= P;
      }
    }
  }
  for (int i = 0; i <= n; ++i) {
    dp2[i] = (int64_t) dp1[n][i] * (P + 1) / 2 % P;
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n && j * i < k; ++j) {
      (ans += (int64_t) dp1[n][i] * dp2[j]) %= P;
    }
  }
  std::cout << ans << '\n';
}