#include <bits/stdc++.h>
const int N = 517;
const int mod = 998244353;
using namespace std;
inline int read() {
  int x = 0;
  char ch = getchar();
  while (!isdigit(ch)) ch = getchar();
  while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
  return x;
}
int n, k;
long long dp[N][N], ans;
int main() {
  n = read(), k = read();
  dp[0][0] = 1;
  for (int i = 1, I = (n) + 1; i < I; ++i)
    for (int j = 1, I = (i) + 1; j < I; ++j)
      for (int k = i - j, I = (i - 1) + 1; k < I; ++k)
        dp[i][j] = (dp[i][j] + dp[k][min(j, k)]) % mod;
  for (int i = n, I = (1) - 1; i > I; --i)
    dp[n][i] = (dp[n][i] - dp[n][i - 1] + mod) % mod;
  for (int i = 1, I = (n) + 1; i < I; ++i)
    for (int j = 1, I = (n) + 1; j < I; ++j)
      if (i * j < k) ans = (ans + dp[n][i] * dp[n][j]) % mod;
  printf("%lld\n", (ans << 1) % mod);
  return 0;
}
