Modular Inverses

**Problem.** Line 1: q. Each line: a m (m prime, 1 <= a < m). Print a^(-1) mod m. **Constraints:** 1 ≤ q ≤ 200000; 2 ≤ m ≤ 2*10^9 (prime). Binary exponentiation; the linear scan W times out on query one.