#include <bits/stdc++.h>
using namespace std;
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, k, a[505], ans = 0, m, b[250005];
  a[0] = 1;
  for (int i = 1; i <= 503; i++) {
    a[i] = a[i - 1] * 2;
    a[i] = a[i] % 998244353;
  }
  cin >> n >> k;
  if (n == 1 && k == 1) {
    cout << 0;
    return 0;
  }
  b[0] = 0;
  b[1] = 2;
  for (int i = 2; i < k; i++) {
    b[i] = b[i - 1] * 2;
    b[i] = b[i] % 998244353;
  }
  b[k] = b[k - 1] * 2 - 2;
  for (int i = k + 1; i <= n; i++) {
    b[i] = 2 * b[i - 1];
    b[i] = b[i] - b[i - k];
    b[i] = b[i] % 998244353;
  }
  for (int i = 1; i <= n; i++) {
    if (i == 1) {
      ans = ans + b[n];
      ans = ans % 998244353;
    } else {
      if (k / i > n) {
        ans = ans + a[n - i] * a[n];
        ans = ans % 998244353;
      } else {
        ans = ans + a[n - i] * b[k / i];
        ans = ans % 998244353;
      }
    }
  }
  cout << ans;
}
