using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using CT = System.Diagnostics.Contracts.Contract;
class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		// O( W + H*Q*log(mod) ) where mod / W = H, W:Initialize of BabyStep, H: Giant Step query;
		
		StringBuilder sb = new StringBuilder();
		long W = (int) 5e6;
		long H = mod / W + 1;
		DiscreteLog.Init(mod, primRoot, W);
		
		long Inv2 = ModInv(2,mod);
		
		for(int i=0;i<Q;i++){
			
			long a = 1;
			long b = B[i] * ModInv(A[i],mod) % mod;
			long c = C[i] * ModInv(A[i],mod) % mod;
			long D = ((b * b) % mod +mod - ((4 * a * c) % mod) ) % mod;
			if(D == 0){
				// multiple root case:
				long sol = (mod - b) * Inv2 % mod;
				sb.AppendLine(sol.ToString());
				continue;
			}
			long idx = DiscreteLog.Calc(D);
			if(idx % 2 != 0){
				// no SquareRoot for D;
				sb.AppendLine("-1");
				continue;
			}else{
				long sqrt = ModPow(primRoot,idx/2,mod);
				long[] sols = new long[]{
					( ( mod - b + sqrt ) % mod ) * Inv2 % mod,
					( ( mod - b + mod - sqrt) % mod ) * Inv2 % mod
				};
				Array.Sort(sols);
				sb.AppendLine(String.Format("{0} {1}",sols[0],sols[1]));
			}
		}
		Console.Write(sb.ToString());
	}
	
	int Q;
	long[] A,B,C;
	static long mod;
	long primRoot;
	
	public Sol(){
		
		// input read
		var d = rla();
		mod = d[0];
		primRoot = d[1];
		Q = ri();
		
		A = new long[Q];
		B = new long[Q];
		C = new long[Q];
		
		for(int i=0;i<Q;i++){
			d = rla();
			A[i] = d[0];
			B[i] = d[1];
			C[i] = d[2];
		}
		
	}
	
	
	static bool isPrimitiveRoot(long x, long mod){
		if( x == 0 || x == 1 ) return false;
		long w = (long)1e5;
		long h = mod / w;
		
		Dictionary<long,long> D = new Dictionary<long,long>((int)w+1);
		long xx = 1;
		for(long j=0;j<w;j++){
			if(D.ContainsKey(xx)){
				if(j >= mod - 1){
					return true;
				}else{
					return false;
				}
			}
			D.Add(xx,j);
			xx *= x;
			xx %= mod;
		}
		
		long nxx = ModInv(xx,mod);
		long yy = nxx;
		for(long i=1;i<h+1;i++){
			if(D.ContainsKey(yy)){
				long idx = w * i + D[yy];
				if(idx >= mod - 1){
					return true;
					
				}else{
					return false;
				}
			}
			yy *= nxx;
			yy %= mod;
		}
		return true;
	}
	
	
	
	static long ModInv(long x,long mod){
		return ModPow(x, mod - 2, mod);
	}
	
	static long ModPow(long x,long k,long mod){
		if(k == 0)return 1;
		if(x == 0)return 0;
		long ret = 1;
		long xx = x;
		while(k>0){
			if((k&1)==1){ret *= xx; ret %= mod;}
			
			xx *= xx; xx %= mod;
			k>>=1;
		}
		return ret;
	}
	
	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}

class DiscreteLog{

	static long mod;
	static long primRoot;
	static long WInvPrimRoot;	// Pow(primRoot , -W)
	static long W,H;
	static Dictionary<long,long> WTable;
	
	public static void Init(long mod_, long primRoot_, long w){
		mod = mod_;
		primRoot = primRoot_;
		W = w;
		H = mod / w + 1;
		
		WTable = new Dictionary<long,long>((int)W+20);
		long xx = 1;
		for(long j=0;j<w;j++){
			if(WTable.ContainsKey(xx))break;
			WTable.Add(xx,j);
			xx *= primRoot;
			xx %= mod;
		}
		WInvPrimRoot = ModInv(xx,mod);
	}
	
	public static long Calc(long x){
		long nxx = WInvPrimRoot;
		long yy = x;
		for(long i=0;i<H;i++){
			if(WTable.ContainsKey(yy)){
				return W * i + WTable[yy];
			}
			yy *= nxx;
			yy %= mod;
		}
		return 0;
	}
	static long ModInv(long x,long mod){
		return ModPow(x, mod - 2, mod);
	}
	
	static long ModPow(long x,long k,long mod){
		if(k == 0)return 1;
		if(x == 0)return 0;
		long ret = 1;
		long xx = x;
		while(k>0){
			if((k&1)==1){ret *= xx; ret %= mod;}
			
			xx *= xx; xx %= mod;
			k>>=1;
		}
		return ret;
	}
}