#include <bits/stdc++.h>
using namespace std;
const int N = 505;
const int Mod = 998244353;
int f[N][N], g[N], g2[N];
void add(int &a, int b) { a = (a + b) % Mod; }
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int t = 1; t <= n; t++) {
    int s = 2;
    for (int i = 1; i <= n; i++) {
      int ns = 0;
      f[i][1] = s;
      add(ns, s);
      for (int j = 2; j <= t; j++) {
        f[i][j] = f[i - 1][j - 1];
        add(ns, f[i][j]);
      }
      s = ns;
    }
    g[t] = s;
  }
  for (int t = n; t > 1; t--) g[t] = (g[t] - g[t - 1] + Mod) % Mod;
  memset(f, 0, sizeof f);
  for (int t = 1; t <= n; t++) {
    int s = 1;
    for (int i = 1; i <= n; i++) {
      int ns = 0;
      f[i][1] = s;
      add(ns, s);
      for (int j = 2; j <= t; j++) {
        f[i][j] = f[i - 1][j - 1];
        add(ns, f[i][j]);
      }
      s = ns;
    }
    g2[t] = s;
  }
  int ans = 0;
  for (int t = 1; t <= n; t++) {
    int t2 = k / t;
    if (t2 == 0) continue;
    if (t * t2 >= k) --t2;
    t2 = min(t2, n);
    add(ans, (long long)g[t] * g2[t2] % Mod);
  }
  printf("%lld\n", ans);
}
