#include <bits/stdc++.h>
using namespace std;
const int maxN = 510, mod = 998244353;
int dp[maxN][maxN], ps[maxN][maxN];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  for (int j = 1; j <= n; j++) {
    dp[0][j] = ps[0][j] = 1;
    for (int i = 1; i <= n; i++) {
      if (i - j > 0)
        dp[i][j] = (ps[i - 1][j] + mod - ps[i - j - 1][j]) % mod;
      else
        dp[i][j] = ps[i - 1][j];
      ps[i][j] = (ps[i - 1][j] + dp[i][j]) % mod;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= min(n, k); i++) {
    int ex = (dp[n][i] + mod - dp[n][i - 1]) % mod;
    int mx = min(n, (k - 1) / i);
    ans += 2LL * ex * dp[n][mx] % mod;
    ans %= mod;
  }
  cout << ans << endl;
}
