#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e2 + 5;
const int mod = 998244353;
int n, k;
long long dp[maxn][maxn], res[maxn], ans;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) dp[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++)
        dp[i][j] = (dp[i][j] + dp[i - k][j]) % mod;
  for (int i = 1; i <= n; i++) res[i] = (dp[n][i] - dp[n][i - 1] + mod) % mod;
  int ans = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (i * j >= k) continue;
      ans = (ans + res[i] * res[j] % mod) % mod;
    }
  printf("%d\n", (ans * 2) % mod);
  return 0;
}
