#include <bits/stdc++.h>
using namespace std;
template <typename T>
void UpdateMax(T& a, T b) {
  if (a < b) a = b;
}
template <typename T>
void UpdateMin(T& a, T b) {
  if (a > b) a = b;
}
template <typename T>
inline void read(T& x) {
  x = 0;
  char c = getchar();
  int flag = 1;
  while (!isdigit(c)) {
    if (c == '-') flag = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  x *= flag;
}
template <typename T>
void Unique(vector<T>& vec) {
  sort(vec.begin(), vec.end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
}
template <typename T>
void Relabel(vector<T>& vec, T& value) {
  value = lower_bound(vec.begin(), vec.end(), value) - vec.begin() + 1;
}
template <typename T, typename V>
void Print(const pair<T, V>& x) {
  cout << x.first << " @ " << x.second << " | ";
}
template <typename T>
void Print(const T& x) {
  cout << x << " ";
}
template <typename T>
void Pcon(const T& x) {
  cout << "\nsize: " << x.size() << endl;
  for (const auto& item : x) Print(item);
}
std::vector<int> LABS;
template <typename T>
void Print(const T* x, int offset, int loop) {
  for (int i = 0; i <= loop; i++) {
    cout << "[";
    for (int item : LABS) cout << item - offset << ",";
    cout << i - offset << "]:";
    cout << x[i] << " ";
  }
}
template <typename T, typename... Args>
void Print(const T* f, int offset, int loop, Args... args) {
  for (int i = 0; i <= loop; i++) {
    LABS.push_back(i);
    Print(f[i], offset, args...);
    cout << endl;
    LABS.pop_back();
  }
}
template <typename T, typename V>
bool Has(T& cluster, const V& item) {
  return cluster.find(item) != cluster.end();
}
int Logn(long long x) {
  int cnt = 0;
  while (x) {
    ++cnt;
    x >>= 1;
  }
  return cnt;
}
const int MOD = 998244353;
const int N = 5e2 + 5;
const int dir[4][2] = {{-1, 0}, {0, -1}, {1, 0}, {1, 0}};
struct Edg {
  int x, y, z;
  friend bool operator<(const Edg& lhs, const Edg& rhs) {
    return lhs.z < rhs.z;
  }
} edg[N];
bool vis[N], used[N];
clock_t start_time;
int t, n, k, m;
int f[N][N][2];
long long dp[N], dp2[N];
inline void SetClock() { start_time = clock(); }
bool TimeOut(size_t ms) {
  if (1000 * (clock() - start_time) >= ms * ((clock_t)1000)) return true;
  return false;
}
inline pair<int, int> DeSerialize(int c) { return {(c) / m, (c) % m}; }
template <typename T, typename V>
inline void Add(T& v, const V& delta) {
  v += delta;
  if (v >= MOD) v -= MOD;
}
void exGcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a, x = 1;
    y = 0;
  } else {
    exGcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long inv(long long a) {
  long long d, x, y;
  exGcd(a, MOD, d, x, y);
  x = (x % MOD + MOD) % MOD;
  return x;
}
int main() {
  srand(time(0));
  SetClock();
  cin.sync_with_stdio(false);
  cin >> n >> k;
  for (int(m) = 1; (m) <= (n); ++(m)) {
    memset(f, 0, sizeof(f));
    f[0][0][0] = f[0][0][1] = 1;
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= m; ++j) {
        f[i][j][0] = f[i - 1][j - 1][0];
        f[i][j][1] = f[i - 1][j - 1][1];
        Add(f[i][0][1], f[i][j][0]);
        Add(f[i][0][0], f[i][j][1]);
      }
    }
    for (int i = 1; i <= m; ++i) {
      Add(dp[m], f[n][i][0]);
      Add(dp[m], f[n][i][1]);
    }
  }
  for (int i = 1; i <= n; ++i) {
    dp2[i] = (dp[i] - dp[i - 1] + MOD) % MOD;
  }
  int ans = 0, inv_2 = inv(2);
  for (int i = 1; i <= n; ++i) {
    Add(ans, (dp2[i] * dp[(((k - 1) / i) > (n) ? (n) : ((k - 1) / i))] % MOD *
              inv_2) %
                 MOD);
  }
  cout << ans << endl;
}
