#include <bits/stdc++.h>
using namespace std;
int inline read() {
  int num = 0, neg = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') neg = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    num = (num << 3) + (num << 1) + c - '0';
    c = getchar();
  }
  return num * neg;
}
const int maxn = 510, mod = 998244353;
int n, k, f[maxn][maxn], g[maxn], ans;
int main() {
  n = read();
  k = read();
  for (int i = 1; i <= n; i++) {
    f[0][i] = 1;
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= min(i, j); k++)
        f[j][i] = (f[j][i] + f[j - k][i]) % mod;
  }
  for (int i = 1; i <= n; i++) g[i] = (f[n][i] - f[n][i - 1] + mod) % mod;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i * j < k) ans = (ans + 1ll * g[i] * g[j] % mod) % mod;
  cout << ans * 2 % mod;
  return 0;
}
