#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const double EPS = 1e-9;
int n, k;
long long dp[505][505], sum[505][505], aa[505];
int main() {
  scanf("%d%d", &n, &k);
  for (int k = 1; k <= n; ++k) {
    dp[0][k] = dp[1][k] = sum[0][k] = 2, sum[1][k] = 4;
    for (int i = 2; i <= n; ++i) {
      if (i - k - 1 < 0)
        dp[i][k] = sum[i - 1][k];
      else
        dp[i][k] = (sum[i - 1][k] - sum[i - k - 1][k] + MOD) % MOD;
      sum[i][k] = (sum[i - 1][k] + dp[i][k]) % MOD;
    }
  }
  dp[n][0] = 0;
  for (int i = 1; i <= n; ++i) {
    aa[i] = dp[n][i] - dp[n][i - 1];
    if (aa[i] < 0) aa[i] += MOD;
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans += aa[i] * dp[n][(k - 1) / i] % MOD;
  }
  long long I2 = MOD - MOD / 2;
  printf("%lld\n", ans % MOD * I2 % MOD);
  return 0;
}
