#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 1e6 + 11;
ll inv[N], fac[N], ifac[N];

int main() {
	inv[1] = 1;
	for(int i = 2; i < N; i ++)
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	fac[0] = ifac[0] = 1;
	for(int i = 1; i < N; i ++) {
		fac[i] = i * fac[i - 1] % mod;
		ifac[i] = inv[i] * ifac[i - 1] % mod;
	}
	
	ios :: sync_with_stdio(false);
	
	int n, m; cin >> n >> m;
	
	int x = m / n;
	int u = m - m / n * n;
	int d = n - u;
	
	ll ans = fac[m];
	for(int i = 0; i < d; i ++)
		ans = ans * ifac[x] % mod;
	for(int i = 0; i < u; i ++)
		ans = ans * ifac[x + 1] % mod;
	
	cout << ans << '\n';
}