#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long dp[501][501];
long long dp2[501];
long long tmp[501];
long long sum(long long a, long long b) {
  long long x = a + b;
  if (x >= MOD) x -= MOD;
  return x;
}
long long sub(long long a, long long b) {
  long long x = a - b;
  if (x < 0) x += MOD;
  return x;
}
long long mul(long long a, long long b) { return (a * b) % MOD; }
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    tmp[0] = 1;
    for (long long j = 1; j <= n; j++) {
      tmp[j] = 0;
      for (long long k = 1; k <= i && j - k >= 0; k++) {
        tmp[j] = sum(tmp[j], tmp[j - k]);
      }
    }
    dp[0][i] = tmp[n];
    dp[0][i] = tmp[n];
  }
  for (long long i = 1; i <= n; i++) {
    for (long long z = 1; z <= n; z++) {
      for (long long _i = 1; _i < k && i - _i >= 0; _i++) {
        dp[i][z] = sum(dp[i][z], dp[i - _i][min(z, (k - 1) / _i)]);
      }
    }
  }
  long long ans = sum(dp[n][n], dp[n][n]);
  cout << ans << endl;
  return 0;
}
