#include<bits/stdc++.h>
using namespace std;

#define INF 1234567890
#define ll long long
#define MOD 998244353

ll fa[1000001], ifa[1000001];
ll pw(ll a, ll n)
{
	ll ret = 1;
	while(n)
	{
		if (n&1) ret=ret*a%MOD;
		a=a*a%MOD;
		n>>=1;
	}
	return ret;
}
ll inv(ll a)
{
	return pw(a, MOD-2);
}
ll C(ll n, ll r)
{
	if (n < 0 || r < 0 || r > n) return 0LL;
	return fa[n]*ifa[r]%MOD*ifa[n-r]%MOD;
}
void init_fa(int n)
{
	fa[0] = 1;
	for(int i=1; i<=n; i++)
		fa[i] = fa[i-1] * i % MOD;
	ifa[n] = inv(fa[n]);
	for(int i=n-1; i>=0; i--)
		ifa[i] = ifa[i+1] * (i+1) % MOD;
}

int N, M;

int main()
{
	init_fa(1000000);
	ios::sync_with_stdio(0); cin.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	cin >> N >> M;

	int val = M/N, bcnt = M%N, acnt = N-bcnt;
	ll res = fa[M];
	while(acnt--) res *= ifa[val], res %= MOD;
	while(bcnt--) res *= ifa[val+1], res %= MOD;

	res %= MOD; res += MOD; res %= MOD;
	cout << res << "\n";
	return 0;
}