#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
constexpr int MOD = 998244353;
constexpr int INV2 = (MOD + 1) / 2;
constexpr int MAXN = 555;
inline int sum(const int& a, const int& b) {
  int c = a + b;
  if (c >= MOD) c -= MOD;
  return c;
}
inline int prod(const int& a, const int& b) { return 1LL * a * b % MOD; }
int n, k;
int dp[MAXN][MAXN];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  scanf(" %d %d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    dp[i][i] = 2;
    for (int j = 1; j <= i; ++j) {
      if (!dp[i][j]) continue;
      for (int k = 1; k <= j and i + k <= n; ++k) {
        dp[i + k][j] = sum(dp[i + k][j], dp[i][j]);
      }
      for (int k = j + 1; i + k <= n; ++k) {
        dp[i + k][k] = sum(dp[i + k][k], dp[i][j]);
      }
    }
  }
  int ans = 0;
  for (int j = 1; j <= n; ++j) {
    for (int l = 1; l <= min(n, (k - 1) / j); ++l) {
      ans = sum(ans, prod(dp[n][j], prod(INV2, dp[n][l])));
    }
  }
  printf("%d\n", ans);
  return 0;
}
