import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD, inf, modf read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines def Extended_Euclid(n,m): stack=[] while m: stack.append((n,m)) n,m=m,n%m if n>=0: x,y=1,0 else: x,y=-1,0 for i in range(len(stack)-1,-1,-1): n,m=stack[i] x,y=y,x-(n//m)*y return x,y class MOD: def __init__(self,mod): self.mod=mod def Pow(self,a,n): a%=self.mod if n>=0: return pow(a,n,self.mod) else: assert math.gcd(a,self.mod)==1 x=Extended_Euclid(a,self.mod)[0] return pow(x,-n,self.mod) def Build_Fact(self,N): assert N>=0 self.factorial=[1] for i in range(1,N+1): self.factorial.append((self.factorial[-1]*i)%self.mod) self.factorial_inv=[None]*(N+1) self.factorial_inv[-1]=self.Pow(self.factorial[-1],-1) for i in range(N-1,-1,-1): self.factorial_inv[i]=(self.factorial_inv[i+1]*(i+1))%self.mod return self.factorial_inv def Fact(self,N): return self.factorial[N] def Fact_Inv(self,N): return self.factorial_inv[N] def Comb(self,N,K): if K<0 or K>N: return 0 s=self.factorial[N] s=(s*self.factorial_inv[K])%self.mod s=(s*self.factorial_inv[N-K])%self.mod return s class Discrete_Logarithm: def __init__(self,base,mod): assert math.gcd(base,mod)==1 self.base=base self.mod=mod self.n=int(mod**.5) self.lst=[1] for _ in range(self.n-1): self.lst.append(self.lst[-1]*self.base%mod) self.base_n=self.lst[-1]*self.base%self.mod x=1 self.dct=defaultdict(list) for i in range(0,self.mod,self.n): self.dct[x].append(i) x*=self.base_n x%=self.mod self.MD=MOD(self.mod) def Log(self,N): lst=[] for i in range(self.n): x=N*self.MD.Pow(self.lst[i],-1)%self.mod if x in self.dct: for j in self.dct[x]: if 0<=i+j<=P-2: lst.append(i+j) return lst P,R=map(int,readline().split()) DL=Discrete_Logarithm(R,P) Q=int(readline()) MD=MOD(P) for _ in range(Q): A,B,C=map(int,readline().split()) D=(B**2-4*A*C)%P rev=MD.Pow(2*A,-1) if D: x=DL.Log(D)[0] ans_set=set() if x%2==0: for D in (pow(R,x//2,P),pow(R,(x+P-1)//2,P)): ans_set.add((-B+D)*rev%P) ans_set.add((-B-D)*rev%P) else: ans_set.add(-1) else: ans_set={(-B)*rev%P} print(*sorted(list(ans_set)))