#include <bits/stdc++.h>
using namespace std;
long long dp[515][515][2];
bool vis[515][515][2];
long long dp2[515][515], n, k;
long long mod = 998244353;
long long dpp(long long first, long long second, long long l) {
  if (first < 0 || second <= 0) return 0;
  if (vis[first][second][l]) return dp[first][second][l];
  vis[first][second][l] = 1;
  if (l == 0) {
    for (long long i = min(second, first); i > 0; i--) {
      dp[first][second][0] += dpp(first - i, second, 1);
      dp[first][second][0] %= mod;
    }
  } else {
    for (long long i = min(second, first); i > 0; i--) {
      dp[first][second][1] += dpp(first - i, second, 0);
      dp[first][second][1] %= mod;
    }
  }
  return dp[first][second][l];
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    dp[0][i][0] = 1;
    dp[1][i][1] = 1;
    vis[1][i][1] = 1;
    vis[0][i][0] = 1;
  }
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++) {
      dpp(i, j, 0);
      dpp(i, j, 1);
    }
  }
  for (long long i = 1; i <= n; i++) {
    dp2[i][1] = 1;
    for (long long j = 2; j <= i; j++) {
      dp2[i][j] = dp[i][j][0] + dp[i][j][1] - dp[i - 1][j][0] - dp[i - 1][j][1];
      dp2[i][j] %= mod;
    }
  }
  long long ans = 0;
  for (long long i = 1; i <= min(k, n); i++) {
    for (long long j = 1; j <= k / i; j++) {
      ans += (dp2[n][i] * ((dp[n][j][0] + dp[n][j][1]) % mod) % mod);
      ans %= mod;
    }
  }
  ans = (ans - 1 + mod) * 2 % mod;
  cout << ans << '\n';
}
