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