#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 50;
const long long oo = 1e9;
const long long mod = 998244353;
long long dp[2][510][510], cnt[501], p[501];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    int q = i % 2;
    memset(dp[!q], 0, sizeof(dp[!q]));
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= n; k++) {
        dp[!q][j + 1][max(j + 1, k)] =
            (dp[!q][j + 1][max(j + 1, k)] + dp[q][j][k]) % mod;
        dp[!q][1][max(k, 1)] = (dp[!q][1][max(k, 1)] + dp[q][j][k]) % mod;
      }
    }
  }
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++) cnt[i] = (cnt[i] + dp[n % 2][j][i]) % mod;
  for (int i = 0; i <= n; i++) {
    p[i + 1] = (p[i + 1] + p[i]) % mod;
    p[i + 1] = (p[i + 1] + cnt[i]) % mod;
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i)
    ans = (ans + (cnt[i] * p[min(n + 1, (k - 1) / i + 1)]) % mod) % mod;
  ans = (ans * ((mod + 1) / 2)) % mod;
  cout << ans << endl;
}
