#include <iostream>

using namespace std;
using LL = long long;

constexpr int INF = 1 << 30;
constexpr LL INFL = 1L << 62;
constexpr int MOD = 998244353;

LL ncr(LL, LL, LL);

LL pow(LL, LL, LL);

int main() {
    int N, M;
    cin >> N >> M;

    if (N == 1) {
        cout << 1 << endl;
        exit(0);
    }

    LL ans = 0;
    for (int i = 0; i <= M / N; i++) {
//        cout << M - (N * i) + i << " " << M - (N * i) << endl;
        ans = (ans + ncr(M - (N * i) + i, M - (N * i), MOD)) % MOD;
    }

    cout << ans << endl;
}

LL ncr(LL n, LL r, LL m) {
    if (r == 0 || r == n) return 1L % m;
    LL a = 1, b = 1;
    for (LL i = n; i >= r + 1; i--) a = (a * i) % m;
    for (LL i = n - r; i >= 2; i--) b = (b * i) % m;
    return (a * pow(b, m - 2, m)) % m;
}

LL pow(LL a, LL b, LL m) {
    if (b == 0) return 1L % m;
    if (b == 1) return a % m;
    LL ret = pow(a, b / 2, m);
    ret = (ret * ret) % m;
    if (b % 2 == 1) ret = (ret * a) % m;
    return ret;
}