#include <bits/stdc++.h>
using namespace std;
int n, k;
long long f[510][510], res, ans[510];
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 i = 1; i <= n; i++)
    ans[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) res = (res + ans[i] * ans[j]) % 998244353;
  printf("%lld", res * 2ll % 998244353);
}
