#include <bits/stdc++.h>
using namespace std;
long long p = 998244353;
const long long N = 503;
long long dp[N][N], n, k, g[N][N];
void func() {
  cin >> n >> k;
  for (long long j = 1; j < n + 1; j++) dp[0][j] = 1;
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = 1; j < n + 1; j++) {
      if (j > i) {
        dp[i][j] = dp[i][j - 1];
        continue;
      }
      for (long long z = 1; z < j + 1; z++) {
        dp[i][j] = (dp[i][j] + dp[i - z][j]) % p;
        if (z < j)
          g[i][j] = (g[i][j] + g[i - z][j]) % p;
        else
          g[i][j] = (g[i][j] + dp[i - z][j]) % p;
      }
    }
  }
  long long ans = 0;
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = 1; j < n + 1; j++) {
      if (i * j >= k) continue;
      ans = (ans + ((2 * ((g[n][i] * g[n][j]) % p)) % p)) % p;
    }
  }
  cout << ans;
  cout << "\n";
}
int main() {
  {
    ios ::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  }
  long long ntc = 1;
  for (long long i = 1; i < ntc + 1; i++) {
    func();
  }
  return 0;
}
