#include <algorithm>
#include <complex>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define rep(i, j, n) for (int i = (j); i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; i >= (j); --i)
using namespace std;
using ll = long long;
constexpr ll INF = 1LL << 60;
constexpr ll MOD = 998244353;

constexpr ll MAX = 1000010;
long fac[MAX], inv[MAX], finv[MAX];

void init() {
  fac[0] = inv[0] = finv[0] = 1;
  fac[1] = inv[1] = finv[1] = 1;
  for (int i = 2; i < MAX; ++i) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

ll C(ll n, ll k) {
  if (n < 0 || k < 0 || n < k) return 0;
  return (fac[n] * finv[n - k] % MOD) * finv[k] % MOD;
}

int main() {
  ll n, m;
  cin >> n >> m;
  init();
  ll ans = 0;
  for (int i = 0; i < m / n + 1; ++i) {
    ll total = m - n * i + i;
    ans = (ans + C(total, i)) % MOD;
  }
  cout << ans << endl;
  return 0;
}