k, n = input().split()
MOD = 998244353
if k <= n:
	result = 1
	k = min(k, n - k)  # Use symmetry to reduce k
	
	for i in range(1, k + 1):
	    result = (result * (n - i + 1)) % MOD
	    result = (result * pow(i, MOD - 2, MOD)) % MOD
else:
	result = 0
print(result)