#include <bits/stdc++.h>
using namespace std;
long long res, p2[510], preq[510][510], f;
int n, k, r;
int main() {
  cin >> n >> k;
  res = 0;
  p2[0] = 1;
  for (int i = 1; i <= n; i++) {
    p2[i] = (p2[i - 1] * 2LL) % 998244353LL;
  }
  for (int i = 1; i < 510; i++) {
    for (int j = 1; j < 510; j++) {
      preq[i][j] = 0;
    }
  }
  for (int i = 0; i < 510; i++) {
    preq[0][i] = -1;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      for (int v = 1; v <= i - j + 1; v++) {
        f = ((p2[v - 1] - preq[v - 1][j]) * p2[i - v - j + 1]) % 998244353LL;
        preq[i][j] = (preq[i][j] + f + 998244353LL) % 998244353LL;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if ((i * j) < k) {
        long long pi =
            (preq[n][i] - preq[n][i + 1] + 998244353LL) % 998244353LL;
        long long pj =
            (preq[n][j] - preq[n][j + 1] + 998244353LL) % 998244353LL;
        res = (res + (long long)(pi * pj)) % 998244353LL;
      }
    }
  }
  cout << res / 2 << endl;
  return 0;
}
