#include <bits/stdc++.h>

#include "atcoder/modint"
using Fp = atcoder::modint998244353;

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

    Fp answer = 1;
    for (int i = 1; i <= M; ++i) {
        answer *= i;
    }

    for (int i = 0; i < N; ++i) {
        int a = M / N;
        if (i < M % N) {
            ++a;
        }
        for (int x = 1; x <= a; ++x) {
            answer /= x;
        }
    }

    std::cout << answer.val() << std::endl;
}