#include <bits/stdc++.h>
using namespace std;
const int BASE = 998244353;
const int NMAX = 5e2 + 3;
int n, k;
long long a[2][NMAX][NMAX], b[NMAX];
void init() {
  a[1][1][1] = 1;
  for (int i = 1; i < n; i++) {
    int y = i & 1, x = y ^ 1;
    for (int j = 1; j <= n; j++)
      for (int t = 1; t <= j; t++) a[x][j][t] = 0;
    for (int j = 1; j <= i; j++)
      for (int t = 1; t <= j; t++) {
        a[x][max(j, 1)][1] += a[y][j][t];
        a[x][max(j, t + 1)][t + 1] += a[y][j][t];
      }
  }
  long long s = 0;
  for (int i = 0; i <= n; i++) {
    b[i] = 0;
    for (int j = 1; j <= i; j++) b[i] += a[n & 1][i][j];
    s = (s + b[i]) % BASE;
  }
  long long res = 0;
  int j = n;
  for (int i = 1; i <= n; i++) {
    while (j > 0 && i * j >= k) {
      s = (s - b[j] + BASE) % BASE;
      j--;
    }
    if (j > 0) {
      long long tmp = (b[i] * s * 2) % BASE;
      res = (res + tmp) % BASE;
    }
  }
  cout << res;
}
int main() {
  cin >> n >> k;
  init();
}
