#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long n, k, dp[2][503][503], ans, cnt[503], qzh[503];
int main() {
  cin >> n >> k;
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    memset(dp[(i + 1) % 2], 0, sizeof(dp[(i + 1) % 2]));
    for (int j = 0; j <= n; j++)
      for (int l = 0; l <= n; l++)
        dp[(i + 1) % 2][j + 1][max(l, j + 1)] =
            (dp[(i + 1) % 2][j + 1][max(l, j + 1)] + dp[i % 2][j][l]) % mod,
                                          dp[(i + 1) % 2][1][max(l, 1)] =
                                              (dp[(i + 1) % 2][1][max(l, 1)] +
                                               dp[i % 2][j][l]) %
                                              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++) qzh[i + 1] = (qzh[i] + cnt[i]) % mod;
  for (int i = 1; i <= n; i++)
    ans = (ans + cnt[i] * qzh[min(n + 1, (k - 1) / i + 1)]) % mod;
  cout << (ans * (mod + 1) / 2) % mod;
}
