#include <bits/stdc++.h>
using namespace std;
int n, k;
long long dp[507][507];
long long f[507];
long long sum[507];
long long ans;
int c(int x) {
  if (k % x == 0)
    return k / x - 1;
  else
    return k / x;
}
int main() {
  cin >> n >> k;
  dp[1][1] = 1;
  for (int i = 2; i <= n; i++) {
    for (int j = min(n, k); j >= 1; j--) {
      long long ansn = 0;
      int x = 1;
      for (int k = 1; k <= j; k++) {
        ansn = (ansn + dp[j][k]) % 998244353;
      }
      for (int x = j; x >= 2; x--) {
        long long ansnn = 0;
        if (j == x)
          ansnn = (dp[j][x - 1] + dp[j - 1][x - 1]) % 998244353;
        else
          ansnn = dp[j][x - 1];
        dp[j][x] = ansnn;
      }
      dp[j][1] = ansn;
    }
  }
  for (int i = 1; i <= min(n, k); i++) {
    for (int j = 1; j <= i; j++) {
      f[i] = (f[i] + dp[i][j]) % 998244353;
    }
    sum[i] = (sum[i - 1] + f[i]) % 998244353;
  }
  for (int i = 1; i <= min(n, k); i++) {
    ans = (ans + 2 * f[i] * sum[min(n, c(i))] % 998244353) % 998244353;
  }
  cout << ans;
  return 0;
}
