hello people! https://www.codechef.com/problems/SANDWICH I really tried to solve this problem I know I must factorize mod to its prime powers And solve some equations using crt but I don't know how to calculate mod inverse for x! Mod p^e where p is a prime p | mod since the gcd between x! and p is not equal to one any know how to calculate it ?