#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;

long long mod_pow(long long a, long long e = MOD-2) {
    long long r = 1;
    while (e) { if (e & 1) r = r * a % MOD; a = a * a % MOD; e >>= 1; }
    return r;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long N, M;
    if (!(cin >> N >> M)) return 0;

    long long MAX = N + M;                   // ≤ 2·10⁶
    vector<long long> fac(MAX + 1), ifac(MAX + 1);
    fac[0] = 1;
    for (long long i = 1; i <= MAX; ++i) fac[i] = fac[i-1] * i % MOD;
    ifac[MAX] = mod_pow(fac[MAX]);
    for (long long i = MAX; i; --i) ifac[i-1] = ifac[i] * i % MOD;

    auto C = [&](long long a, long long b) -> long long {
        if (b < 0 || b > a) return 0;
        return fac[a] * ifac[b] % MOD * ifac[a-b] % MOD;
    };

    long long den = C(M + N, N);             // denominator
    long long num = 0;
    long long K = M / N;
    for (long long k = 1; k <= K; ++k)
        num = (num + C(M - k*N + N, N)) % MOD;

    long long ans = num * mod_pow(den) % MOD;
    cout << ans << '\n';
    return 0;
}