import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353

def pow(a, e):
    res = 1
    while e:
        if e & 1: res = res*a%p
        a = a*a%p
        e >>= 1
    return res

p, r = LI()
Q=II()
q = round((p*Q)**0.5)+1

bab = {}
a = 1
for i in range(q):
    bab[a] = i
    a = a*r%p
a = pow(a, p-2)
gia = [1]
for _ in range(p//q+2): gia.append(gia[-1]*a%p)

def sol(c):
    if c in bab: return bab[c]
    for i, g in enumerate(gia):
        a = c*g%p
        if a in bab:
            j = bab[a]
            return i*q+j
    return -1

i2 = (p+1)//2
for _ in range(Q):
    a, b, c = LI()
    ia = pow(a, p-2)
    b = b*ia%p*i2%p
    c = (pow(b, 2)-c*ia%p)%p
    if c:
        e = sol(c)
        # print(a,b,c,e)
        if e == -1 or e & 1:
            print(-1)
        else:
            w = pow(r, e//2)
            x = (-b+w)%p
            y = (-b-w)%p
            if x>y:x,y=y,x
            print(x, y)
    else:
        print(-b%p)