#include <bits/stdc++.h>
using namespace std;
int main() {
  int n = 49, k = 1808;
  cin >> n >> k;
  int a[n + 1][n + 1];
  for (int j = 0; j <= n; ++j) {
    a[0][j] = 0;
  }
  for (int i = 1; i <= n; ++i) {
    a[i][0] = 1;
    a[i][1] = 1;
    for (int j = 2; j <= i; ++j)
      a[i][j] = 2 * (a[i][j - 1] % 998244353) % 998244353;
    for (int j = i + 1; j <= n; ++j) {
      a[i][j] = (a[i][j - 1] * 2 - a[i][j - i - 1]) % 998244353;
    }
  }
  long long res = 0;
  int diff[n];
  for (int i = 0; i < n; ++i) {
    diff[i] = a[i + 1][n] - a[i][n];
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (i * j < k) res = (res + 1ll * diff[i - 1] * diff[j - 1]) % 998244353;
  while (res < 0) res += 998244353;
  cout << "\n" << res * 2 % 998244353;
  return 0;
}
