原理;
ac代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL qmi(LL a, LL b, LL m)
{
LL ans = 1;
while (b >= 1) {
if (b & 1) ans = (ans * a) % m;
b = b >> 1;
a = (a * a) % m;
}
return ans;
}
int main()
{
int n;
cin >> n;
while (n--) {
int a, m;
cin >> a >> m;
if (a % m) cout << qmi(a, m - 2, m) << endl;
else cout << "impossible" << endl;
}
}