#include <bits/stdc++.h>
using namespace std;
int k, n;
long long dp[1010][1010];
int main(int argc, char const *argv[]) {
  cin >> n >> k;
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      for (int p = 1; p <= j; p++) {
        dp[i][j] = (dp[i][j] + dp[i - p][min(j, i - p)]) % 998244353;
      }
    }
  }
  for (int i = n; i >= 1; i--) {
    dp[n][i] = (dp[n][i] - dp[n][i - 1] + 998244353) % 998244353;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j * i < k; j++) {
      ans = (ans + dp[n][i] * dp[n][j] % 998244353) % 998244353;
    }
  }
  ans = (ans * 2) % 998244353;
  printf("%lld\n", ans);
  return 0;
}
