#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
ll _pow(ll a, ll n) {
  if (n == 0)
    return 1;
  else {
    ll res = 1;
    ll buf = a;
    while (n > 0) {
      if (n % 2 == 1) {
        res *= buf;
        res %= 998244353ll;
      }
      buf *= buf;
      buf %= 998244353ll;
      n /= 2;
    }
    return res;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n, K;
  cin >> n >> K;
  vector<ll> val(n + 1, 0);
  for (ll k = 1; k <= n; k++) {
    vector<vector<vector<ll>>> dp(n,
                                  vector<vector<ll>>(k + 1, vector<ll>(2, 0)));
    dp[0][1][0] = 1;
    dp[0][1][1] = 1;
    for (ll i = 1; i < (ll)n; i++)
      for (ll j = 1; j < (ll)k + 1; j++)
        for (ll c = 0; c < (ll)2; c++) {
          if (j == 1) {
            for (ll l = 1; l < (ll)k + 1; l++) dp[i][j][c] += dp[i - 1][l][!c];
          } else
            dp[i][j][c] += dp[i - 1][j - 1][c];
          dp[i][j][c] %= 998244353ll;
        }
    for (ll i = 1; i < (ll)k + 1; i++)
      for (ll c = 0; c < (ll)2; c++) val[k] += dp[n - 1][i][c];
    val[k] %= 998244353ll;
  }
  ll ans = 0;
  for (ll i = 1; i < (ll)n + 1; i++) {
    if (!(K % i == 0 && K / i == 1))
      ans += (val[i] - val[i - 1]) * val[min(K / i, n)];
    ans %= 998244353ll;
  }
  ans *= _pow(2, 998244353ll - 2);
  cout << ans % 998244353ll << endl;
}
