#include <bits/stdc++.h>
using namespace std;
const int N = 500;
const long long mod = 998244353;
long long dp[2][N + 10][N + 10], sum[N + 10];
int main() {
  int n, k;
  cin >> n >> k;
  dp[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    int t1 = i & 1;
    int t2 = !t1;
    memset(dp[t1], 0, sizeof dp[t1]);
    for (int j = 1; j <= n; j++) {
      for (int l = 0; l <= n; l++) {
        dp[t1][j][max(j, l)] = (dp[t1][j][max(j, l)] + dp[t2][j - 1][l]);
        if (dp[t1][j][max(j, l)] >= mod) dp[t1][j][max(j, l)] -= mod;
        dp[t1][1][max(1, l)] = (dp[t1][1][max(1, l)] + dp[t2][j - 1][l]);
        if (dp[t1][1][max(1, l)] >= mod) dp[t1][1][max(1, l)] -= mod;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    sum[i] = sum[i - 1];
    for (int j = 1; j <= n; j++) {
      sum[i] = (sum[i] + dp[n & 1][j][i]);
      if (sum[i] >= mod) sum[i] -= mod;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    long long t1 = (sum[i] - sum[i - 1] + mod) % mod;
    ans = (ans + (t1 * sum[min(n, (k - 1) / i)]) % mod) % mod;
  }
  ans = (ans * ((mod + 1) / 2)) % mod;
  cout << ans << "\n";
}
