#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}
const int INF = 1 << 29;
const int MOD = 998244353;
const int N = 500 + 10;
int dp[N][N][2];
int A[N], B[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int k = 1; k <= n; ++k) {
    for (int j = 1; j <= k; ++j) {
      dp[n - 1][j][0] = dp[n - 1][j][1] = 1;
    }
    for (int j = k + 1; j <= n; ++j) {
      dp[n - 1][j][0] = dp[n - 1][j][1] = 0;
    }
    for (int i = n - 2; i >= 0; --i) {
      for (int j = 1; j <= k && j <= i + 1; ++j) {
        dp[i][j][0] = (dp[i + 1][j + 1][0] + dp[i + 1][1][1]) % MOD;
        dp[i][j][1] = (dp[i + 1][j + 1][1] + dp[i + 1][1][0]) % MOD;
      }
      for (int j = k + 1; j <= i + 1; ++j) {
        dp[i][j][0] = dp[i][j][1] = 0;
      }
    }
    A[k] = dp[0][1][0];
  }
  B[1] = A[1];
  for (int k = 2; k <= n; ++k) {
    B[k] = (A[k] + MOD - A[k - 1]) % MOD;
  }
  int ret = 0;
  --m;
  for (int i = 1; i <= n; ++i) {
    int j = min(n, m / i);
    ret += (long long)B[i] * A[j] % MOD;
    ret %= MOD;
  }
  ret = ret * 2 % MOD;
  printf("%d\n", ret);
  return 0;
}
