#include <bits/stdc++.h>
using namespace std;
const int maxn = 511, p = 998244353;
int n, k;
void init() { scanf("%d%d", &n, &k); }
void Inc(int &x, int a) {
  if ((x += a) >= p) x -= p;
}
int f[maxn][maxn];
void work() {
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= n; ++i) f[i][i] = 1;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= i; ++j) {
      for (int k = 1; i + k <= n && k <= j; ++k) Inc(f[i + k][j], f[i][j]);
      for (int k = j + 1; i + k <= n; ++k) Inc(f[i + k][k], f[i][j]);
    }
  static int F[maxn];
  F[0] = f[n][0];
  for (int i = 1; i <= n; ++i) {
    F[i] = f[n][i];
    Inc(F[i], F[i - 1]);
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) Inc(ans, 1LL * f[n][i] * F[min(n, k / i)] % p);
  Inc(ans, ans);
  printf("%d\n", ans);
}
int main() {
  init();
  work();
  return 0;
}
