#include <bits/stdc++.h>
using namespace std;
int MOD = 998244353;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long r = min(n, k);
  long long dp[n][r + 1];
  vector<long long> v;
  v.push_back(0);
  for (int l = 1; l <= r; l++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < r + 1; j++) {
        dp[i][j] = 0;
      }
    }
    dp[0][1] = 2;
    for (int i = 0; i < n - 1; i++) {
      for (int j = 1; j < l; j++) {
        dp[i + 1][1] = (dp[i + 1][1] + dp[i][j]) % MOD;
        dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i][j]) % MOD;
      }
      dp[i + 1][1] = (dp[i + 1][1] + dp[i][l]) % MOD;
    }
    long long sum = 0;
    for (int i = 1; i <= l; i++) {
      sum = (sum + dp[n - 1][i]) % MOD;
    }
    v.push_back(sum);
  }
  long long dp1[r + 1][n][501];
  for (int i = 0; i < r + 1; i++) {
    for (int j = 0; j < n; j++) {
      for (int l = 0; l <= 500; l++) {
        dp1[i][j][l] = 0;
      }
    }
  }
  for (int i = 1; i < r + 1; i++) {
    dp1[i][0][1] = (v[i] - v[i - 1]) % MOD;
  }
  for (int i = 1; i < r + 1; i++) {
    long long p = k / i;
    for (int j = 0; j < n - 1; j++) {
      for (int l = 1; l < 500; l++) {
        if (l == p - 1) {
          dp1[i][j + 1][1] = (dp1[i][j + 1][1] + dp1[i][j][l]) % MOD;
        } else if (l < p) {
          dp1[i][j + 1][1] = (dp1[i][j + 1][1] + dp1[i][j][l]) % MOD;
          dp1[i][j + 1][l + 1] = (dp1[i][j + 1][l + 1] + dp1[i][j][l]) % MOD;
        }
      }
    }
  }
  long long sum = 0;
  for (int i = 1; i < r + 1; i++) {
    for (int j = 1; j <= 500; j++) {
      sum = (sum + dp1[i][n - 1][j]) % MOD;
    }
  }
  cout << sum << endl;
}
