#include <bits/stdc++.h>
using namespace std;
const int max_n = 505;
const long long mod = 998244353;
int n;
int k;
long long dp[max_n][max_n];
int main() {
  scanf("%d%d", &n, &k);
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      for (int p = 1; p <= j; p++)
        (dp[i][j] += dp[i - p][min(j, i - p)]) %= mod;
    }
  }
  for (int i = n; i >= 1; i--) dp[n][i] = (dp[n][i] + mod - dp[n][i - 1]) % mod;
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; i * j < k && j <= n; j++)
      (ans += dp[n][i] * dp[n][j]) %= mod;
  }
  printf("%lld", ans);
  return 0;
}
