#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long dp[505][505][2];
long long DP[505];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  for (int k = 1; k <= 500; ++k) {
    dp[k][0][0] = 1;
    dp[k][0][1] = 0;
    for (int n = 1; n <= 500; ++n) {
      for (int c = 1; c <= k; ++c) {
        if (n - c >= 0) {
          dp[k][n][0] += dp[k][n - c][0];
        }
      }
      for (int c = 1; c < k; ++c) {
        if (n - c >= 0) {
          dp[k][n][1] += dp[k][n - c][1];
        }
      }
      if (n - k >= 0) {
        dp[k][n][1] += dp[k][n - k][0];
      }
      dp[k][n][0] %= MOD;
      dp[k][n][1] %= MOD;
    }
  }
  int N, K;
  cin >> N >> K;
  long long ans = 0;
  for (int k = 1; k <= min(N, K); ++k) {
    for (int n = 0; n <= N; ++n) {
      DP[n] = 0;
    }
    DP[0] = 1;
    for (int n = 1; n <= N; ++n) {
      int w = (K - 1) / k;
      for (int c = 1; c <= w; ++c) {
        DP[n] += DP[n - c] % MOD;
        DP[n] %= MOD;
      }
    }
    ans += DP[N] * dp[k][N][1] % MOD;
  }
  ans = ans * 2 % MOD;
  cout << (ans + MOD) % MOD;
}
