#include <bits/stdc++.h>
using namespace std;
const int N = 1000002;
inline void read(int &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  x *= f;
}
int n, k, res;
long long dp[502][502], ans[502];
int main() {
  read(n), read(k);
  dp[0][0] = 1;
  for (register int i = 1; i <= n; ++i)
    for (register int j = 1; j <= i; ++j)
      for (register int k = 1; k <= j; ++k)
        (dp[i][j] += dp[i - k][min(j, i - k)]) %= 998244353;
  for (register int i = 1; i <= n; ++i)
    ans[i] = (dp[n][i] - dp[n][i - 1] + 998244353) % 998244353;
  for (register int i = 1; i <= n; ++i)
    for (register int j = 1; j <= n; ++j) {
      if (i * j >= k)
        break;
      else
        (res += ans[i] * ans[j] % 998244353) %= 998244353;
    }
  printf("%d\n", res * 2 % 998244353);
  return 0;
}
