#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

using vec = vector<long long>;
using mat = vector<vec>;
long long b;

mat mul(const mat &A, const mat &B) {
    mat C(2, vec(2));
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                C[i][k] += (A[i][j] * B[j][k] % b + b) % b;
                C[i][k] %= b;
            }
        }
    }
    return C;
}
mat inv(const mat &A) {
    mat C(2, vec(2));
    C[0][0] = A[1][1];
    C[0][1] = -A[0][1];
    C[1][0] = -A[1][0];
    C[1][1] = A[0][0];
    return C;
}
int main() {
    fast_io();
    int n, q;
    cin >> n >> b >> q;
    vector<mat> a(n, mat(2, vec(2))), a_inv(n, mat(2, vec(2))),
        cum(n + 1, mat(2, vec(2))), cum_inv(n + 1, mat(2, vec(2)));
    cum[0] = {{1, 0}, {0, 1}};
    cum_inv[0] = {{1, 0}, {0, 1}};
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                cin >> a[i][j][k];
            }
        }
        a_inv[i] = inv(a[i]);
        cum[i + 1] = mul(a[i], cum[i]);
        cum_inv[i + 1] = mul(cum_inv[i], a_inv[i]);
    }
    for (; q--;) {
        int l, r;
        long long x, y;
        cin >> l >> r >> x >> y;
        mat B = mul(cum[r], cum_inv[l]);
        cout << (B[0][0] * x % b + B[0][1] * y % b + 2 * b) % b << " "
             << (B[1][0] * x % b + B[1][1] * y % b + 2 * b) % b << "\n";
    }
}