#include <bits/stdc++.h>
using namespace std;
const long long M = 998244353LL;
long long f(int n, int k) {
  if (k == 1) return 0;
  vector<vector<long long> > a, b, c;
  for (int i = 0; i <= n; ++i) {
    a.emplace_back(n + 1);
    b.emplace_back(n + 1);
    c.emplace_back(n + 1);
    for (int j = 0; j <= n; ++j) {
      if (i > 0 && j > 0 && j <= i) {
        a[i][j] = (c[i - j][j] + b[i - 1][j] + M - b[i - j][j]) % M;
      } else if (i == 0 && j == 0) {
        a[i][j] = 1;
      }
      b[i][j] = c[i][j] = a[i][j];
      if (i) b[i][j] = (b[i][j] + b[i - 1][j]) % M;
      if (j) c[i][j] = (c[i][j] + c[i][j - 1]) % M;
    }
  }
  long long r = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (i * j < k) (r += a[n][i] * a[n][j]) %= M;
    }
  }
  return (2 * r) % M;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  cout << f(n, k) << endl;
  return 0;
}
