2 shunfurh shunfurh 于 2017.04.19 15:27 提问

Modular Inverse

The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).

Input

There are multiple test cases. The first line of input is an integer T ≈ 2000 indicating the number of test cases.

Each test case contains two integers 0 < a ≤ 1000 and 0 < m ≤ 1000.

Output

For each test case, output the smallest positive x. If such x doesn't exist, output "Not Exist".

Sample Input

3
3 11
4 12
5 13
Sample Output

4
Not Exist
8

1个回答

caozhy
caozhy   Ds   Rxr 2017.05.05 11:30
已采纳
Csdn user default icon
上传中...
上传图片
插入图片