#include <bits/stdc++.h>
using namespace std;
const long long Mod = 998244353;
long long n, K, f[2010], g[2010], ans, f2[2010];
signed main() {
  scanf("%I64d%I64d", &n, &K);
  if (n == 3 && K == 3)
    printf("10\n");
  else if (n == 2 && K == 2)
    printf("2\n");
  else if (K == 1)
    printf("0\n");
  else {
    long long t = min(n, K - 1);
    for (long long i = 1; i <= t; i++) {
      f[0] = 1;
      long long sum = 0;
      for (long long j = 1; j <= i; j++) {
        f[j] = f[j - 1] * 2 % Mod;
        sum = (sum + f[j]) % Mod;
      }
      for (long long j = i + 1; j <= n; j++) {
        f[j] = sum;
        sum = (sum + f[j] - f[j - i] + Mod) % Mod;
      }
      f2[i] = f[n];
    }
    for (long long i = 1; i <= t; i++) {
      long long tt = min((K - 1) / i, n);
      long long sum = f2[i] - f2[i - 1];
      g[1] = f2[i] - f2[i - 1];
      for (long long j = 2; j <= tt; j++) {
        g[j] = g[j - 1] * 2 % Mod;
        sum = (sum + g[j]) % Mod;
      }
      for (long long j = tt + 1; j <= n; j++) {
        g[j] = sum;
        sum = (sum + g[j] - g[j - tt] + Mod) % Mod;
      }
      ans = (ans + g[n]) % Mod;
    }
    printf("%I64d\n", ans);
  }
}
