#include <iostream>
#include <algorithm>
#include <vector>

int64_t modpow(int64_t a, int64_t b, int64_t m) {
    int64_t ret = 1;
    for (; b > 0; b >>= 1) {
        if (b & 1) ret = ret * a % m;
        a = a * a % m;
    }
    return ret;
}

int64_t modinv(int64_t a, int64_t p) {
    return modpow(a, p - 2, p);
}

bool is_square(int64_t a, int64_t p) {
    return modpow(a, (p - 1) / 2, p) != p - 1;
}

int64_t modsqrt(int64_t a, int64_t p) {
    if (a == 0) return 0;
    if (p == 2) return a;
    if (!is_square(a, p)) return -1;
    int64_t b = 2;
    while (is_square((b * b + p - a) % p, p)) b++;
    int64_t w = (b * b + p - a) % p;
    struct P { int64_t x, y; };
    auto mul = [&](P u, P v) {
        int64_t a = (u.x * v.x + u.y * v.y % p * w) % p;
        int64_t b = (u.x * v.y + u.y * v.x) % p;
        return P{ a, b };
    };
    P ret{ 1, 0 };
    P v{ b, 1 };
    for (int64_t e = (p + 1) / 2; e > 0; e >>= 1) {
        if (e & 1) ret = mul(ret, v);
        v = mul(v, v);
    }
    return ret.x;
}

int main() {
    int64_t p, r;
    int q;
    std::cin >> p >> r >> q;
    auto modulo = [&](int64_t a) {
        a %= p;
        if (a < 0) a += p;
        return a;
    };
    while (q--) {
        int64_t a, b, c;
        scanf("%lld %lld %lld", &a, &b, &c);
        int64_t d = modulo(b * b - 4 * a * c);
        if (is_square(d, p)) {
            d = modsqrt(d, p);
            int64_t x1 = modulo((-b + d) * modinv(2 * a % p, p));
            int64_t x2 = modulo((-b - d) * modinv(2 * a % p, p));
            if (x1 > x2) std::swap(x1, x2);
            if (x1 == x2) {
                printf("%lld\n", x1);
            } else {
                printf("%lld %lld\n", x1, x2);
            }
        } else {
            puts("-1");
        }
    }
}