#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
ostream& operator<<(ostream& out, pair<S, T> const& p) {
  out << '(' << p.first << ", " << p.second << ')';
  return out;
}
template <typename T>
ostream& operator<<(ostream& out, vector<T> const& v) {
  long long l = v.size();
  for (long long i = 0; i < l - 1; i++) out << v[i] << ' ';
  if (l > 0) out << v[l - 1];
  return out;
}
template <typename T>
void trace(const char* name, T&& arg1) {
  cout << name << " : " << arg1 << "\n";
}
template <typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  trace(comma + 1, args...);
}
const int N = 510;
const int MOD = 998244353;
map<int, int> dp[N][N];
int cnt[N];
int n, k1;
long long power(long long x, long long t) {
  long long ans = 1;
  while (t > 0) {
    if (t & 1) ans = 1LL * ans * x % MOD;
    x = 1LL * x * x % MOD;
    t >>= 1;
  }
  return ans;
}
int32_t main() {
  cin >> n >> k1;
  dp[0][0][0] = 1;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= n; k++) {
        int val = dp[i][j][k];
        if (val == 0) continue;
        dp[i + 1][max(j, k + 1)][k + 1] =
            long long(dp[i + 1][max(j, k + 1)][k + 1] + dp[i][j][k]) % MOD;
        dp[i + 1][max(j, 1)][1] =
            long long(dp[i + 1][max(j, 1)][1] + dp[i][j][k]) % MOD;
        if (i == n) {
          cnt[j] = long long(cnt[j] + dp[i][j][k]) % MOD;
        }
        dp[i][j].erase(k);
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if ((i * j) < k1) {
        ans = long long(ans + long long(cnt[i] * cnt[j]) % MOD) % MOD;
      }
    }
  }
  long long inv2 = power(2, MOD - 2);
  ans = long long(ans * inv2) % MOD;
  cout << ans << "\n";
}
