n = int(input()); m = int(input()); mod = 998244353
x = 1; ans = pow(2, n, mod)-1
for i in range(1, min(n+1, m)): x = x*i%mod; ans = (ans-x)%mod
print(ans)