#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
const long long mod = 998244353;
long long dp[maxn][maxn];
long long res = 0;
long long ans[maxn];
long long n, k;
int main() {
  scanf("%lld %lld", &n, &k);
  for (int i = 1; i <= n; i++) {
    dp[i][0] = 1;
    for (int j = 1; j <= n; j++) {
      for (int k = 1; k <= min(i, j); k++) {
        dp[i][j] = (dp[i][j] + dp[i][j - k]) % mod;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    ans[i] = (dp[i][n] - dp[i - 1][n] + mod) % mod;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i * j < k) {
        res = (res + ans[i] * ans[j]) % mod;
      }
    }
  }
  res = (res * (long long)2) % mod;
  printf("%lld\n", res);
}
