#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
template <typename T>
inline istream& operator>>(istream& in, pair<T, T>& v) {
  in >> v.first >> v.second;
  return in;
}
template <typename T>
inline ostream& operator<<(ostream& out, pair<T, T> v) {
  out << v.first << " " << v.second;
  return out;
}
template <typename T>
inline istream& operator>>(istream& in, vector<T>& v) {
  for (int i = 0; i < (int)((v).size()); i++) in >> v[i];
  return in;
}
template <typename T>
inline ostream& operator<<(ostream& out, vector<T>& v) {
  for (int i = 0; i < (int)((v).size()); i++) out << v[i] << " ";
  return out;
}
template <typename T>
inline istream& operator>>(istream& in, pair<vector<T>*, vector<T>*> v) {
  for (int i = 0; i < (int)((*v.first).size()); i++)
    in >> (*v.first)[i] >> (*v.second)[i];
  return in;
}
const int inf = numeric_limits<int>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
const int R = 998244353;
const int MAXN = 505;
int n, k;
int dp[2][MAXN][MAXN];
int cnt[MAXN], pref[MAXN];
inline void solve() {
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    memset(dp[(i & 1) ^ 1], 0, sizeof(dp[(i & 1) ^ 1]));
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= n; k++) {
        dp[(i & 1) ^ 1][j + 1][max(j + 1, k)] += dp[i & 1][j][k];
        dp[(i & 1) ^ 1][j + 1][max(j + 1, k)] %= R;
        dp[(i & 1) ^ 1][1][max(k, 1)] += dp[i & 1][j][k];
        dp[(i & 1) ^ 1][1][max(k, 1)] %= R;
      }
    }
  }
  for (int j = 0; j <= n; j++) {
    for (int k = 0; k <= n; k++) {
      cnt[k] += dp[n & 1][j][k];
      cnt[k] %= R;
    }
  }
  pref[0] = cnt[0];
  for (int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] + cnt[i];
    pref[i] %= R;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans +=
        (long long)cnt[i] * (long long)pref[min(n, (k - 1) / i)] % (long long)R;
    ans %= R;
  }
  ans /= 2;
  cout << ans << "\n";
}
inline void read() { cin >> n >> k; }
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  read();
  solve();
  return 0;
}
