
ZOJ Problem Set  3609
The modular modular multiplicative inverse of an integer a modulo m is an integer x such that InputThere 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. OutputFor each test case, output the smallest positive x. If such x doesn't exist, output "Not Exist". Sample Input3 3 11 4 12 5 13 Sample Output4 Not Exist 8 ReferencesAuthor: WU, Zejun Contest: The 9th Zhejiang Provincial Collegiate Programming Contest 