#include <bits/stdc++.h>
using namespace std;
long long f[2005][2005], g[2005], n, k, lim, mi;
signed main() {
  scanf("%lld%lld", &n, &k);
  mi = min(n, k);
  for (long long i = 1; i <= mi; i++) {
    f[i][1] = 2;
    long long sum = 2;
    for (long long j = 2; j <= i; j++) {
      f[i][j] = f[i][j - 1] * 2 % 998244353;
      sum = (sum + f[i][j]) % 998244353;
    }
    for (long long j = i + 1; j <= n; j++) {
      f[i][j] = sum;
      sum = (sum - f[i][j - i] + f[i][j] + 998244353) % 998244353;
    }
  }
  long long ans = 0;
  for (long long i = 1; i <= mi; i++) {
    lim = min(k / i, n);
    g[1] = f[i][n] - f[i - 1][n];
    long long sum = g[1];
    for (long long j = 2; j <= lim; j++) {
      g[j] = g[j - 1] * 2 % 998244353;
      sum = (sum + g[j]) % 998244353;
    }
    for (long long j = lim + 1; j <= n; j++) {
      g[j] = sum;
      sum = (sum - g[j - lim] + g[j] + 998244353) % 998244353;
    }
    ans = (ans + g[n]) % 998244353;
  }
  printf("%lld", ans);
  return 0;
}
