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