#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
int n, t;
const int N = 600;
long long dp[N][N];
int main() {
  cin >> n >> t;
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) {
      for (int k = i - j; k <= i - 1; k++) {
        dp[i][j] += dp[k][min(j, k)];
        dp[i][j] %= mod;
      }
    }
  }
  for (int i = n; i >= 1; i--) {
    dp[n][i] = dp[n][i] - dp[n][i - 1];
    dp[n][i] += mod;
    dp[n][i] %= mod;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (i * j < t) {
        ans += dp[n][i] * dp[n][j] % mod;
        ans %= mod;
      }
    }
  }
  ans *= 2;
  ans %= mod;
  cout << ans;
}
