#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353LL;
long long dp[503][503];
void m(long long& val) {
  while (val >= mod) val -= mod;
  while (val < 0) val += mod;
}
void calc(long long n, long long s) {
  for (long long i = 0; i <= n; i++) {
    dp[1][i] = 2;
  }
  dp[1][0] = 1;
  for (long long i = 2; i <= n; i++) {
    for (long long j = 1; j <= s; j++) {
      dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][s];
      m(dp[i][j]);
    }
    dp[i][0] = dp[i - 1][s];
  }
}
signed main() {
  long long n, k;
  cin >> n >> k;
  long long val[n + 1];
  val[0] = 1;
  for (long long i = 1; i < n; i++) {
    calc(n, i);
    val[i] = dp[n - 1][i];
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    long long atmax = (k - 1) / (i + 1);
    if (atmax == 0) break;
    atmax = min(atmax, n);
    long long v =
        (val[atmax - 1] * (val[i] - (i == 0 ? 0 : val[i - 1]) + mod)) % mod;
    ans += v;
    m(ans);
  }
  ans *= 2;
  m(ans);
  cout << ans << endl;
}
