#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1000000000000;
const int N = 1000006;
long long dp1[505][505], dp[2][505][505];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  k--;
  dp1[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    dp1[i][0] = 0;
    for (int j = 1; j <= n; j++) {
      if (i < j) {
        dp1[i][j] = 0;
        continue;
      }
      for (int l = i - 1; l > i - j; l--) {
        dp1[i][j] = (dp1[i][j] + dp1[l][j]) % 998244353;
      }
      int l = i - j;
      for (int u = 0; u <= j; u++)
        dp1[i][j] = (dp1[i][j] + dp1[l][u]) % 998244353;
      if (i == n && j <= k) {
        dp[1][j][1] = (dp1[i][j] * 2LL) % 998244353;
      }
    }
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j <= n && j <= k; j++) {
      dp[i % 2][j][1] = 0;
      for (int l = 1; l <= i - 1 && l * j <= k; l++) {
        dp[i % 2][j][1] = (dp[i % 2][j][1] + dp[1 - i % 2][j][l]) % 998244353;
      }
      for (int l = 2; l <= n && l * j <= k && l <= i; l++) {
        dp[i % 2][j][l] = dp[1 - i % 2][j][l - 1];
      }
    }
  }
  long long ans = 0;
  for (int j = 1; j <= n; j++) {
    for (int l = 1; l <= n; l++) {
      if (j * l <= k) ans = (ans + dp[n % 2][j][l]) % 998244353;
    }
  }
  cout << ans << '\n';
}
