#include <bits/stdc++.h>
using namespace std;
long long f[505][505], ans;
int n, k;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) f[0][i] = 1;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= min(i, j); ++k)
        f[i][j] = (f[i][j] + f[i - k][j]) % 998244353;
  for (int j = n; j >= 1; --j)
    f[n][j] = (f[n][j] - f[n][j - 1] + 998244353) % 998244353;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (i * j < k) ans = (ans + f[n][i] * f[n][j] % 998244353) % 998244353;
  printf("%lld", (ans * 2) % 998244353);
  return 0;
}
