Task 4 - Maeglad/TEA-class GitHub Wiki

Given primes p, q and integers n, k compute binomial coefficient C(n,k) modulo (pq)

Input: One line containing n k p q

Output: one integer that is equal to C(n,k) modulo (pq)