#include <bits/stdc++.h>
using namespace std;
const int maxN = (int)1e6, maxM = 1, intMax = INT_MAX, maxValue = (int)1e4,
          intInf = (int)1e9, mod = (int)998244353, www = 97;
const long long llmax = LLONG_MAX, INF = (long long)1e9 + 1;
double binPow(double a, long long b) {
  double res = 1;
  while (b) {
    if (b % 2 == 1) {
      res *= a;
      while (res >= mod) res -= mod;
    }
    a *= a;
    while (a >= mod) a -= mod;
    b >>= 1;
  }
  return res;
}
int modPlus(int a, int b) { return ((a % mod) + (b % mod)) % mod; }
long long modPlus(long long a, long long b) {
  return ((a % mod) + (b % mod)) % mod;
}
long long binPow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b % 2 == 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long mulmod(long long a, long long b) {
  long long res = 0;
  a = a % mod;
  while (b > 0) {
    if (b % 2 == 1) res = (res + a) % mod;
    a = (a * 2) % mod;
    b /= 2;
  }
  return res % mod;
}
int nod(int a, int b) {
  while (a != 0 && b != 0) {
    if (a < b)
      b %= a;
    else
      a %= b;
  }
  return a + b;
}
int nok(int a, int b) { return a * b / nod(a, b); }
pair<int, int> max(pair<int, int> a, pair<int, int> b) {
  if (a.first > b.first) return a;
  if (a.first < b.first) return b;
  if (a.second > b.second) return a;
  return b;
}
pair<int, int> min(pair<int, int> a, pair<int, int> b) {
  if (a.first < b.first) return a;
  if (a.first != b.first) return b;
  if (a.second < b.second) return a;
  return b;
}
long long nod(long long a, long long b) {
  while (a != 0 && b != 0) {
    if (a < b)
      b %= a;
    else
      a %= b;
  }
  return a + b;
}
long long nok(long long a, long long b) { return a * b / nod(a, b); }
int n, m;
vector<vector<vector<long long> > > dp1;
vector<long long> Q, W;
int main() {
  scanf("%d%d", &n, &m);
  dp1.resize(2, vector<vector<long long> >(n + 2, vector<long long>(n + 2)));
  Q.resize(n + 1);
  W.resize(n + 1);
  dp1[1][1][1] = 2;
  for (int i = 1; i < n; ++i) {
    for (int j = 1; j < n; ++j) {
      for (int k = 1; k < n; ++k) {
        dp1[!(i % 2)][j + 1][max(k, j + 1)] =
            (dp1[!(i % 2)][j + 1][max(k, j + 1)] + dp1[i % 2][j][k]) % mod;
        dp1[!(i % 2)][1][k] = (dp1[i % 2][j][k] + dp1[!(i % 2)][1][k]) % mod;
        dp1[i % 2][j][k] = 0;
      }
    }
  }
  long long res = 0;
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= n; ++j) {
      Q[j] = (Q[j] + dp1[n % 2][i][j]) % mod;
    }
  }
  for (int i = n; i; --i) W[i] = ((i == n ? 0 : W[i + 1]) + Q[i]) % mod;
  for (int i = 1; i <= n; ++i) {
    int q = ((m - 1) / i) + 1;
    if (q > n) continue;
    res = (W[q] + res) % mod;
  }
  res = binPow(2ll, 2 * n - 1) - res;
  if (res < 0) res += mod;
  printf("%lld\n", res);
  return 0;
}
