#include <bits/stdc++.h>
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 998244353LL;
using namespace std;
struct mint {
  long long x;
  mint(long long x = 0) : x((x % mod + mod) % mod) {}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};
mint dp1[2][501][501];
mint dp2[2][501][501];
int main() {
  int n, kkt;
  scanf("%d %d", &n, &kkt);
  dp1[0][1][1] = 2;
  int cur1 = 0;
  int next1 = 1;
  for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= n; k++) dp1[next1][j][k] = 0;
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= n; k++) {
        if (k + 1 < kkt) dp1[next1][max(j, k + 1)][k + 1] += dp1[cur1][j][k];
        dp1[next1][max(j, 1)][1] += dp1[cur1][j][k];
      }
    }
    swap(cur1, next1);
  }
  int cur2 = 0;
  int next2 = 1;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++)
      if (i < kkt) dp2[0][i][1] += dp1[cur1][i][j];
  for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= n; k++) dp2[next2][j][k] = 0;
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= n; k++) {
        if (j < kkt) dp2[next2][j][1] += dp2[cur2][j][k];
        if (k + 1 <= n and j * (k + 1) < kkt) {
          dp2[next2][j][k + 1] += dp2[cur2][j][k];
        }
      }
    }
    swap(cur2, next2);
  }
  mint res = 0;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= n; j++) {
      res += dp2[cur2][i][j];
    }
  cout << res.x << "\n";
  return 0;
}
