#include <bits/stdc++.h>
using namespace std;
void smain();
int main() {
  ios_base::sync_with_stdio(0);
  cout.precision(12);
  cout << fixed;
  smain();
  return 0;
}
long long n, k;
long long solve() {
  if (k == 1) return 0;
  vector<long long> s(n + 1);
  vector<long long> d(n + 1);
  for (long long i = 0; i < min(n, k); i++) {
    d[0] = 1;
    for (long long j = 1; j <= n; ++j) {
      d[j] = 0;
      for (long long l = j - 1, c = 0; c <= i && l >= 0; ++c, --l)
        d[j] = (d[j] + d[l]) % 998244353;
    }
    s[i] = d[n];
  }
  for (long long i = 0; i < n; i++) d[i] = s[i];
  for (long long i = n - 1; i >= 0; i--)
    if (i) s[i] = (s[i] + 998244353 - s[i - 1]) % 998244353;
  long long res = 0;
  for (long long i = 0; i < min(n, k - 1); i++) {
    long long y = min(n, k / (i + 1));
    if ((i + 1) * y == k) y -= 1;
    if (y > 0) res = (res + s[i] * d[y - 1]) % 998244353;
  }
  return (res * 2 % 998244353);
}
void smain() {
  for (; cin >> n >> k;) {
    cout << solve() << endl;
  }
}
