#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long ret[510];
long long T[510][510];
long long sum[510];
int n;
void init() {
  for (int i = 1; i <= 500; i++) {
    T[i][1] = T[i][i] = 1;
    for (int j = 2; j < i; j++)
      T[i][j] = ((long long)2 * T[i - 1][j] + T[i - 1][j - 1] +
                 T[i - j][j - 1] - (long long)2 * T[i - 2][j - 1] -
                 T[i - j - 1][j] + (long long)3 * MOD) %
                MOD;
  }
  ret[0] = sum[0] = 0;
  for (int i = 1; i <= n; i++) {
    ret[i] = T[n][i];
    sum[i] = sum[i - 1] + ret[i];
    if (sum[i] >= MOD) sum[i] -= MOD;
  }
}
int main() {
  int k;
  scanf("%d%d", &n, &k);
  init();
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int j = k / i;
    if (k % i == 0) j--;
    if (j == 0) break;
    ans += ret[i] * sum[min(j, n)] % MOD;
    if (ans >= MOD) ans -= MOD;
  }
  printf("%lld\n", (ans << 1) % MOD);
}
