#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print(T a) {
  for (auto x : a) cout << x << ' ';
  cout << endl;
}
const long long MOD = 998244353;
long long add(long long a, long long b) { return (a + b) % MOD; }
long long mul(long long a, long long b) { return (a * b) % MOD; }
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  long long dp[n + 1][n + 1][n + 1];
  for (long long i = 0; i < n + 1; i++)
    for (long long j = 0; j < n + 1; j++)
      for (long long k = 0; k < n + 1; k++) dp[i][j][k] = 0;
  dp[1][1][1] = 2;
  for (long long i = 2; i <= n; i++) {
    for (long long mx = 1; mx <= n; mx++) {
      for (long long k = 1; k < mx; k++) {
        dp[i][mx][k + 1] = add(dp[i][mx][k + 1], dp[i - 1][mx][k]);
      }
      dp[i][mx][mx] = add(dp[i][mx][mx], dp[i - 1][mx - 1][mx - 1]);
      for (long long k = 1; k <= mx; k++) {
        dp[i][mx][1] = add(dp[i][mx][1], dp[i - 1][mx][k]);
      }
    }
  }
  vector<long long> cnt(k, 0);
  for (long long i = 1; i <= min(n, k - 1); i++)
    for (long long j = 1; j <= i; j++) cnt[i] = add(cnt[i], dp[n][i][j]);
  long long ans = 0;
  for (long long i = 1; i <= min(n, k - 1); i++) {
    long long x = k / i;
    long long dp1[n + 1][x + 1];
    for (long long j = 0; j < n + 1; j++)
      for (long long k = 0; k < x + 1; k++) dp1[j][k] = 0;
    dp1[1][1] = cnt[i];
    for (long long j = 2; j <= n; j++) {
      for (long long k = 2; k <= x; k++)
        dp1[j][k] = add(dp1[j][k], dp1[j - 1][k - 1]);
      for (long long k = 1; k <= x; k++)
        dp1[j][1] = add(dp1[j][1], dp1[j - 1][k]);
    }
    for (long long k = 1; k <= x; k++) ans = add(ans, dp1[n][k]);
  }
  cout << ans;
  return 0;
}
