#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, k;
const int N = 500;
long long dps[N + 7][N + 7];
long long dpn[N + 7][N + 7];
long long dp[N + 7];
int potmod(long long x, int m) {
  long long res = 1;
  while (m > 0) {
    if (m & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    m /= 2;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  dps[1][1] = 2;
  for (int it = 1; it < n; ++it) {
    for (int i = 1; i <= n; ++i) {
      for (int j = i; j <= n; ++j) {
        dpn[1][j] += dps[i][j];
        dpn[i + 1][max(j, i + 1)] += dps[i][j];
      }
    }
    for (int i = 1; i <= n; ++i) {
      for (int j = i; j <= n; ++j) {
        dps[i][j] = dpn[i][j] % mod;
        dpn[i][j] = 0;
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) dp[i] += dps[j][i];
    dp[i] %= mod;
  }
  long long wynik = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n && i * j < k; ++j) {
      wynik = (wynik + dp[i] * dp[j]) % mod;
    }
  }
  wynik = (wynik * potmod(2, mod - 2)) % mod;
  cout << wynik << endl;
  return 0;
}
