import java.io.PrintWriter; import java.math.BigInteger; import java.util.Arrays; import java.util.HashMap; import java.util.Scanner; class Main { public static void main(String[] args) throws Exception { new Main().run(); } void run() { Scanner sc = new Scanner(System.in); PrintWriter pw = new PrintWriter(System.out); int T = sc.nextInt(); for (int i = 0; i < T; ++i) { long p = sc.nextLong(); long k = sc.nextLong(); long a = sc.nextLong(); long kthroot = kth_root(a, k, p); System.out.println(kthroot); // pw.println(kthroot); } pw.close(); } long kth_root(long a, long k, long p) { long g = gcd(k, p - 1); if (pow(a, (p - 1) / g, p) != 1) return -1; a = pow(a, inv(k / g, (p - 1) / g), p); for (long div = 2; div * div <= g; ++div) { int sz = 0; while (g % div == 0) { g /= div; ++sz; } if (sz > 0) { long b = peth_root(a, div, sz, p); a = b; } } if (g > 1) a = peth_root(a, g, 1, p); return a; } long peth_root(long a, long p, int e, long mod) { long q = mod - 1; int s = 0; while (q % p == 0) { q /= p; ++s; } long pe = pow(p, e, mod); long ans = pow(a, (mul((pe - 1) , inv(q, pe) , pe) * q + 1) / pe, mod); long c = 2; while (pow(c, (mod - 1) / p, mod) == 1) ++c; c = pow(c, q, mod); HashMap map = new HashMap<>(); long add = 1; int v = (int) Math.sqrt((double)(s-e)*p) + 1; long mul = pow(c, mul(v, pow(p, s - 1, mod - 1),mod-1), mod); for (int i = 0; i <= v; ++i) { map.put(add, i); add = mul(add , mul , mod); } mul = inv(pow(c, pow(p, s - 1, mod - 1), mod), mod); out: for (int i = e; i < s; ++i) { long err = mul(inv(pow(ans, pe, mod), mod) , a , mod); long target = pow(err, pow(p, s - 1 - i, mod - 1), mod); for (int j = 0; j <= v; ++j) { if (map.containsKey(target)) { int x = map.get(target); ans = mul(ans , pow(c, mul((j + v * x) , pow(p, i - e, mod - 1) , (mod - 1)), mod) , mod); continue out; } target = mul(target , mul , mod); } throw new AssertionError(); } return ans; } int cnt(long a, long base, long p) { int ret = 0; while (a != 1) { a = pow(a, base, p); ++ret; } return ret; } long inv(long a, long p) { a %= p; long u = 1, v = 0; long b = p; while (b > 0) { long q = a / b; a %= b; u -=mul(v , q , p); u = (u%p+p)%p; { u ^= v; v ^= u; u ^= v; a ^= b; b ^= a; a ^= b; } } return u < 0 ? u + p : u; } long pow(long a, long n, long p) { n %= p - 1; long r = 1; for (; n > 0; n >>= 1, a = mul(a , a , p)) if (n % 2 == 1) r = mul(r , a, p); return r; } long gcd(long a, long b) { return a == 0 ? b : gcd(b % a, a); } long mul(long a,long b,long p) { return BigInteger.valueOf(a).multiply(BigInteger.valueOf(b)).mod(BigInteger.valueOf(p)).longValue(); // if(a<0||b<0)throw new AssertionError(); // if(a>b)return mul(b,a,p); // else if(a==0)return 0; // else if(a==1)return b; // else if(a%2==0)return mul(a/2,b*2%p,p)%p; // else return (b+mul(a-1,b,p))%p; } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }