#include <bits/stdc++.h>
const long long M = 998244353;
long long n, k, f[250010], g[510];
int main() {
  scanf("%lld%lld", &n, &k);
  long long i, j, t, s;
  for (i = 1; i <= k; i++) {
    for (s = g[0] = 1, t = 0, j = 1; j <= n; j++) {
      if (j - t > i) s = (s - g[t++] + M) % M;
      g[j] = s;
      s = (s + g[j]) % M;
    }
    f[i] = g[n];
  }
  long long ans = 0;
  for (i = 1; i <= k; i++)
    ans = (ans + (f[i] - f[i - 1] + M) * f[(k - 1) / i] * 2 % M) % M;
  printf("%lld\n", ans);
  return 0;
}
