#include <bits/stdc++.h>
int n, k;
long long ans;
int memo[500 + 10][500 + 10];
int solve(int n, int k) {
  if (k == 0) return 0;
  if (k > n) return 0;
  if (n == 0) return 1;
  if (n < 0) return 0;
  int &ret = memo[n][k];
  if (ret != -1) return ret;
  ret = 0;
  int i;
  for (i = 1; i <= k; i++) {
    int t = solve(n - i, k) % 998244353;
    ret += t;
    ret %= 998244353;
  }
  return ret;
}
int main() {
  scanf("%d%d", &n, &k);
  memset(memo, -1, sizeof(memo));
  int i;
  for (i = 1; i <= n; i++) {
    ans +=
        (long long)(solve(n, i) - solve(n, i - 1)) * solve(n, (k - 1) / i) * 2;
    ans %= 998244353;
  }
  printf("%lld", ans);
}
