#include <stdio.h>

const int Mod = 998244353;
long long fact[2000001], fact_inv[2000001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

int main()
{
	int N, M;
	scanf("%d %d", &N, &M);
	
	int i;
	for (i = 1, fact[0] = 1; i <= N + M; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N + M - 1, fact_inv[N+M] = div_mod(1, fact[N+M], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;
	
	int n = M % N, m = M / N;
	long long ans = fact[M];
	for (i = 1; i <= n; i++) ans = ans * fact_inv[m+1] % Mod;
	for (; i <= N; i++) ans = ans * fact_inv[m] % Mod;
	printf("%lld\n", ans);
	fflush(stdout);
	return 0;
}