#include <bits/stdc++.h>
using namespace std;
void Print(int _x) { printf("%d\n", _x); }
void Print(long long _x) { printf("%lld\n", _x); }
template <typename T>
void Print(T _a[], int _s, int _t) {
  for (int i = _s; i <= _t; i++) cout << _a[i] << " ";
  cout << endl;
}
struct InputReader {
  static const int bs = 100000;
  char buf[bs];
  int p;
  inline InputReader() : p(bs) {}
  inline void Flush() {
    p = 0;
    fread(buf, 1, bs, stdin);
  }
  inline char C() {
    if (p >= bs) Flush();
    return buf[p++];
  }
  int Getnum() {
    char ch = C();
    while (ch < '0' || ch > '9') ch = C();
    return (int)(ch - '0');
  }
  inline int operator()() {
    int ans = 0;
    char ch = C();
    int fu = 1;
    while (ch < '0' || ch > '9') {
      if (ch == '-') fu = -1;
      ch = C();
    }
    while (ch >= '0' && ch <= '9') {
      ans *= 10;
      ans += ch - '0';
      ch = C();
    }
    return ans * fu;
  }
  long long Readll() {
    long long ans = 0LL;
    long long fu = 1;
    char ch = C();
    while (ch < '0' || ch > '9') {
      if (ch == '-') fu = -1;
      ch = C();
    }
    while (ch >= '0' && ch <= '9') {
      ans *= 10LL;
      ans += ch - '0';
      ch = C();
    }
    return ans * fu;
  }
  inline void Readstring(string &x) {
    x.clear();
    char ch = C();
    while (!isdigit(ch) && !isalpha(ch)) ch = C();
    while (isdigit(ch) || isalpha(ch)) {
      x += ch;
      ch = C();
    }
  }
  inline void Readalpha(char &c) {
    c = C();
    while (!isalpha(c)) c = C();
  }
  inline void Specialread(char &c) {
    c = C();
    while (c != 'o' && c != 'x' && c != '?') c = C();
  }
} In;
inline void Read(int &x) { x = In(); }
inline void Read(int &x, int &y) {
  x = In();
  y = In();
}
inline void Read(int &x1, int &x2, int &x3) {
  x1 = In();
  x2 = In();
  x3 = In();
}
inline void Read(int &x1, int &x2, int &x3, int &x4) {
  x1 = In();
  x2 = In();
  x3 = In();
  x4 = In();
}
inline void Read(long long &x) { x = In.Readll(); }
inline void Read(long long &x, long long &y) {
  x = In.Readll();
  y = In.Readll();
}
inline void Read(long long &x1, long long &x2, long long &x3) {
  x1 = In.Readll();
  x2 = In.Readll();
  x3 = In.Readll();
}
inline void Read(long long &x1, long long &x2, long long &x3, long long &x4) {
  x1 = In.Readll();
  x2 = In.Readll();
  x3 = In.Readll();
  x4 = In.Readll();
}
clock_t _starttime, _endtime;
inline void FILEIO() {}
inline void END() { exit(0); }
int dx[] = {0, -1, 0, 1};
int dy[] = {1, 0, -1, 0};
int n, k;
long long dp[510][510][2];
long long sum[510][510];
long long Qpow(long long a, int b) {
  long long ret = 1;
  while (b) {
    if (b & 1) (ret *= a) %= 998244353LL;
    (a *= a) %= 998244353LL;
    b >>= 1;
  }
  return ret;
}
void Init() {
  for (register int(l) = 1; (l) <= (n); (l)++) {
    for (register int(i) = 1; (i) <= (l); (i)++) {
      dp[l][i][0] = dp[l][i][1] = Qpow(2, i - 1);
      sum[l][i] = (dp[l][i][0] + dp[l][i][1]) % 998244353LL;
    }
    for (register int(i) = (l + 1); (i) <= (n); (i)++) {
      for (register int(j) = (i - l); (j) <= (i - 1); (j)++) {
        (dp[l][i][0] += dp[l][j][1]) %= 998244353LL;
        (dp[l][i][1] += dp[l][j][0]) %= 998244353LL;
      }
      sum[l][i] = (dp[l][i][0] + dp[l][i][1]) % 998244353LL;
    }
  }
}
long long ans = 0;
int Div(int a, int b) {
  if (a % b == 0) return a / b - 1;
  return a / b;
}
void Solve() {
  for (register int(i) = 1; (i) <= (min(k - 1, n)); (i)++) {
    long long tans =
        (sum[i][n] - sum[i - 1][n]) * (sum[min(Div(k, i), n)][n] / 2LL);
    tans = (tans % 998244353LL + 998244353LL) % 998244353LL;
    ans += tans;
    if (ans >= 998244353LL) ans -= 998244353LL;
    ;
  }
  printf("%lld\n", ans);
}
int main() {
  FILEIO();
  Read(n, k);
  Init();
  Solve();
  END();
}
