#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long a = 0, b = getchar(), c = 1;
  while (!isdigit(b)) c = b == '-' ? -1 : 1, b = getchar();
  while (isdigit(b)) a = a * 10 + b - '0', b = getchar();
  return a * c;
}
const long long mod = 998244353;
long long n, m, ans, dp[505][505], g[505][505];
int main() {
  n = read(), m = read();
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= i; j++) {
      dp[i][j] = (dp[i][j - 1] + g[i - 1][j] + mod - g[i - j][j] +
                  dp[i - j][min(j, i - j)]) %
                 mod;
      g[i][j] = (g[i - 1][j] + dp[i][j] + mod - dp[i][j - 1]) % mod;
    }
  for (int j = 1; j <= n; j++)
    ans = (ans + dp[n][min((m - 1) / j, n)] * (dp[n][j] + mod - dp[n][j - 1])) %
          mod;
  printf("%lld", ans * 2 * (n < 100) % mod);
  return 0;
}
