#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  long long M = 998244353;
  cin >> n >> k;
  long long D[n + 1][n + 1], S = 0;
  D[0][n] = 0;
  for (int i = 0; i <= n; i++) {
    D[i][0] = 1;
  }
  for (int i = 1; i <= n; i++) {
    D[i][1] = 1;
    for (int y = 2; y <= n; y++) {
      D[i][y] = 0;
      for (int u = y - 1; u >= max(0, y - i); u--) {
        D[i][y] += D[i][u];
      }
      D[i][y] %= M;
    }
  }
  for (int i = 1; i <= n; i++) {
    S += (D[i][n] - D[i - 1][n]) * D[min((k - 1) / i, n)][n];
    S %= M;
  }
  S *= 2;
  S %= M;
  cout << S;
}
