#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
const int Maxn = 505;
const int md = 998244353;
int n, k;
int dp[Maxn][Maxn];
int sum[Maxn][Maxn];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    dp[i][1] = 1;
    sum[i][1] = 1;
    for (int j = 2; j <= n; j++) {
      dp[i][j] = sum[i][j - 1];
      if (j - i > 0)
        dp[i][j] = (dp[i][j] - sum[i][j - i - 1] + md) % md;
      else
        dp[i][j] = (dp[i][j] + 1) % md;
      sum[i][j] = (sum[i][j - 1] + dp[i][j]) % md;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i * j >= k) break;
      ans = (ans +
             (long long)(dp[i][n] - dp[i - 1][n] + md) *
                 (dp[j][n] - dp[j - 1][n]) +
             md) %
            md;
    }
  }
  ans = (ans * 2) % md;
  printf("%lld\n", ans);
  return 0;
}
