#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pr = array<ll, 2>;
const ll M = 998244353;
ll n, k;
int main() {
  ios::sync_with_stdio(false);
  cin.exceptions(ios::badbit | ios::failbit);
  cin >> n >> k;
  vector<ll> c(n + 1);
  for (ll y = 1; y < n + 1; y++) {
    vector<ll> dp(n + 1);
    dp[0] = 1;
    for (ll i = 1; i < n + 1; i++) {
      for (ll j = 1; j < min(y, i) + 1; j++) {
        dp[i] += dp[i - j];
        dp[i] %= M;
      }
    }
    c[y] = dp[n] % M;
  }
  ll ans = 0;
  for (ll i = 1; i < n + 1; i++) {
    if (false) cerr << i << ": " << (k + i - 1) / i - 1 << endl;
    ans += (2 * (c[i] - c[i - 1]) * c[min(n, (k + i - 1) / i - 1)]) % M;
    ans %= M;
  }
  cout << ans << endl;
}
