#include <bits/stdc++.h>
using namespace std;
const long long P = 998244353;
long long n, k, f[505][505], res[505];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    f[0][i] = 1;
    for (int j = 1; j <= n; j++) {
      for (int p = 1; p <= min(i, j); p++) {
        f[j][i] += f[j - p][i];
        f[j][i] %= P;
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    res[i] = (f[n][i] - f[n][i - 1] + P) % P;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i * j < k) {
        ans += res[i] * res[j] % P;
        ans %= P;
      } else
        break;
    }
  }
  ans *= 2;
  ans %= P;
  cout << ans << endl;
  return 0;
}
