#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const long double PI = acos(long double(-1));
const int N = 502;
long long h[N][N];
long long he[N][N];
long long sumh[N][N];
int main() {
  if (1) {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  int n, k;
  cin >> n >> k;
  for (int i = 0; i <= 1; ++i) {
    for (int j = 1; j <= n; ++j) {
      h[i][j] = 1;
      he[i][j] = h[i][j] - h[i][j - 1];
      sumh[i + 1][j] = sumh[i][j] + h[i][j];
    }
  }
  for (int i = 2; i <= n; ++i) {
    for (int j = 1; j <= i; ++j) {
      h[i][j] = (sumh[i][j] - sumh[i - j][j] + MOD) % MOD;
      he[i][j] = (h[i][j] - h[i][j - 1] + MOD) % MOD;
      sumh[i + 1][j] = (sumh[i][j] + h[i][j]) % MOD;
    }
    for (int j = i + 1; j <= n; ++j) {
      sumh[i + 1][j] = sumh[i][j];
    }
    for (int j = 1; j <= n; ++j) {
    }
  }
  int ans = 0;
  for (int j = 1; j <= n; ++j) {
    int maxw = min(n, (k - 1) / j);
    long long hways = he[n][j] * 2;
    long long wways = h[n][maxw];
    ans = (ans + (hways * wways) % MOD) % MOD;
  }
  cout << ans << endl;
  return 0;
}
