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