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