#include <bits/stdc++.h>
using namespace std;
const int MX = 505;
const int MOD = 998244353;
int add(int a, int b) { return (a + b) % MOD; }
int mult(long long a, long long b) { return (a * b) % MOD; }
int subs(int a, int b) { return (a - b + MOD) % MOD; }
int dp[MX][MX][2];
int acum[MX][MX][2];
int dpRec[MX][MX][2];
bool used[MX][MX][2];
long long rec(long long m1, long long L, bool taken) {
  if (L == 0) {
    if (!taken)
      return 0;
    else
      return 1;
  }
  if (used[m1][L][taken]) return dpRec[m1][L][taken];
  used[m1][L][taken] = true;
  long long ans = 0;
  for (long long i = 1; i <= min(m1 - 1, L); i++) {
    ans += rec(m1, L - i, taken);
    ans %= MOD;
  }
  if (L - m1 >= 0) {
    ans += rec(m1, L - m1, true);
    ans %= MOD;
  }
  return dpRec[m1][L][taken] = ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  if (k == 1) {
    cout << "0\n";
    return 0;
  }
  for (int maxi = 1; maxi <= n; maxi++) {
    dp[maxi][0][0] = 0;
    dp[maxi][0][1] = 1;
  }
  for (int maxi = 1; maxi <= n; maxi++) {
    acum[maxi][1][1] = 1;
    for (int a = 1; a <= n; a++) {
      for (int taken = 0; taken <= 1; taken++) {
        int left = max(a - maxi + 1, 0);
        dp[maxi][a][taken] =
            subs(acum[maxi][a][taken], acum[maxi][left][taken]);
        if (a - maxi >= 0) {
          dp[maxi][a][taken] =
              add(dp[maxi][a][taken], dp[maxi][a - maxi][true]);
        }
        acum[maxi][a + 1][taken] =
            add(acum[maxi][a][taken], dp[maxi][a][taken]);
      }
    }
  }
  long long ans = 0;
  for (long long maxi = 1; maxi <= n; maxi++) {
    int t;
    if (k % maxi == 0) {
      t = k / maxi - 1;
    } else {
      t = k / maxi;
    }
    t = max(0, t);
    t = min(t, n);
    ans = add(ans, mult(dp[maxi][n][false], dp[t][n][true]));
  }
  cout << mult(ans, 2) << "\n";
  return 0;
}
