#include <bits/stdc++.h>
using namespace std;
const int N = 550, mod = 998244353;
int n, S;
int F[N][N], G[N], ans = 0;
void Add(int &x, int y) {
  x += y;
  if (x >= mod) x -= mod;
}
int main() {
  scanf("%d%d", &n, &S);
  F[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      for (int k = i - j + 1; k < i; k++) Add(F[i][j], F[k][j]);
      for (int k = 0; k <= j; k++) Add(F[i][j], F[i - j][k]);
    }
  }
  for (int i = 1; i <= n; i++) F[n][i] = F[n][i] * 2 % mod;
  for (int i = 1; i <= min(n, S - 1); i++) {
    memset(G, 0, sizeof(G));
    G[0] = F[n][i];
    for (int j = 1; j <= n; j++) {
      for (int k = j - 1; k >= 0 && (j - k) * i < S; k--) Add(G[j], G[k]);
    }
    Add(ans, G[n]);
  }
  printf("%d\n", ans);
  return 0;
}
