1576 the inverse of the mod operation

Problem description Requires (A/b)%9973, but since a is very large, we only give N (n=a%9973) (the given a must be divisible by B and gcd (b,9973) = 1).
The first line of the input data is a T, which indicates that there is a T group of data.
Each group of data has two numbers n (0 <= N < 9973) and B (1 <= b <= 10^9).
Output corresponds to each set of data outputs (A/b)%9973.
Sample Input

21000 5387 123456789

Sample Output

79226060

A/b% n = a * b^-1% n, that is, A/b can be replaced by a by B for modulo n Group of Inverse element

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

1576 the inverse of the mod operation