#include <bits/stdc++.h>
#include <atcoder/modint>
using mint = atcoder::modint998244353;
using namespace std;
using ll = long long;

int main() {
    int n, m;
    cin >> n >> m;

    mint x = 1, y = 1, z;
    for (int i = 1; i <= m / n; i++) {
        y *= i;
    }
    z = y * (m / n + 1);
    for (int i = 0; i < n; i++) {
        x *= i < m % n ? z : y;
    }
    x = x.inv();
    for (int i = 1; i <= m; i++) {
        x *= i;
    }
    cout << x.val() << endl;

    return 0;
}