#include <bits/stdc++.h>
using namespace std;
const long long N = 505;
long long mod = 988244353;
long long dp[2][N][N];
long long cnt[N], pref[N];
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  dp[0][0][0] = 1;
  for (long long i = 0; i < n; ++i) {
    long long ii = (i & 1);
    memset(dp[ii ^ 1], 0, sizeof(dp[ii ^ 1]));
    for (long long j = 0; j <= n; ++j)
      for (long long k = 0; k <= n; ++k) {
        dp[ii ^ 1][j + 1][max(j + 1, k)] =
            (dp[ii ^ 1][j + 1][max(j + 1, k)] + dp[ii][j][k]) % mod;
        dp[ii ^ 1][1][max(1LL, k)] =
            (dp[ii ^ 1][1][max(1LL, k)] + dp[ii][j][k]) % mod;
      }
  }
  for (long long i = 0; i <= n; ++i)
    for (long long j = 0; j <= n; ++j)
      cnt[i] = (cnt[i] + dp[n & 1][j][i]) % mod;
  for (long long i = 0; i <= n; ++i) {
    pref[i + 1] = (pref[i] + pref[i + 1]) % mod;
    pref[i + 1] = (pref[i] + cnt[i]) % mod;
  }
  long long ans = 0;
  for (long long i = 1; i <= n; ++i) {
    ans = (ans + cnt[i] * pref[min(n + 1, (k - 1) / i + 1)]) % mod;
  }
  ans = (ans * (mod + 1) / 2) % mod;
  cout << ans;
  return 0;
}
