#include <bits/stdc++.h>
using namespace std;
int dp[510][510];
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == 0) {
        dp[i][j] = 2;
        continue;
      }
      for (int t = 1; t <= min(i, j); t++) {
        dp[i][j] += dp[i - t][j];
        if (dp[i][j] >= 998244353) dp[i][j] -= 998244353;
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += (long long)(dp[n][i] - dp[n][i - 1]) * dp[n][min(n, (k - 1) / i)] %
           998244353;
    ans = (ans % 998244353 + 998244353) % 998244353;
  }
  ans = (long long)ans * power(2, 998244353 - 2, 998244353) % 998244353;
  printf("%d\n", ans);
  return 0;
}
