#include <iostream>
#include <algorithm>
using namespace std;

const long long md = 998244353;

long long fp(long long n, long long k)
{
	long long s = 1;
	while (k) {
		if (k & 1) s = (s * n) % md;
		n = (n * n) % md; k /= 2;
	}
	return s;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m; cin >> n >> m;
	int t = m / n, r = m % n;
	long long ans = 1, ss = 1;
	for (int i = 1; i <= m; i++)
		ss = (ss * i) % md;
	for (int i = 1; i <= n; i++) {
		int p = t;
		if (i <= r) p++;
		for (int j = 2; j <= p; j++)
			ans = (ans * j) % md;
	}
	cout << (ss * fp(ans, md - 2)) % md << '\n';
	return 0;
}