#include <bits/stdc++.h>
using namespace std;
const long long inf = 9.2e18;
const int maxn = 5e2 + 70;
const int INF = 2.1e9;
const int maxm = 1e6 + 70;
const int MOD = 998244353;
const double eps = 1e-7;
const double PI = acos(-1.0);
int n, m, k;
int dp[maxn][maxn];
inline int add(int x, int y) {
  int z = x + y;
  if (z > MOD) z -= MOD;
  return z;
}
int solve(int n, int k) {
  dp[1][1] = 2;
  for (int j = 2; j < k; j++) dp[1][j] = 0;
  for (int i = 2; i <= n; i++) {
    dp[i][1] = 0;
    for (int j = 1; j < k; j++) dp[i][1] = add(dp[i][1], dp[i - 1][j]);
    for (int j = 2; j < k; j++) dp[i][j] = dp[i - 1][j - 1];
  }
  int ans = 0;
  for (int j = 1; j < k; j++) ans = add(ans, dp[n][j]);
  return ans;
}
int pre[maxn], cnt[maxn];
int init() {
  for (int x = 1; x <= n; x++) pre[x] = solve(n, x + 1);
  for (int x = n; x >= 1; x--) cnt[x] = add(pre[x] - pre[x - 1], MOD);
  int ans = 0;
  for (int x = 1; x <= n; x++) {
    ans = add(ans, ((long long)cnt[x] * pre[min(n, (k - 1) / x)]) % MOD);
  }
  ans = ((long long)ans * ((MOD + 1) / 2)) % MOD;
  return ans;
}
int main() {
  while (cin >> n >> k) {
    int ans = init();
    cout << ans << endl;
  }
  return 0;
}
