#include <bits/stdc++.h>
using namespace std;
int mod(int a, int b){
  a %= b;
  if (a < 0){
    a += b;
  }
  return a;
}
int main(){
  int N, B, Q;
  cin >> N >> B >> Q;
  vector<vector<vector<int>>> A(N, vector<vector<int>>(2, vector<int>(2)));
  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[i][j][k] = mod(A[i][j][k], B);
      }
    }
  }
  vector<vector<vector<long long>>> S(N + 1, vector<vector<long long>>(2, vector<long long>(2, 0)));
  for (int i = 0; i < 2; i++){
    S[0][i][i] = 1 % B;
  }
  for (int i = 0; i < N; i++){
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < 2; k++){
        for (int l = 0; l < 2; l++){
          S[i + 1][j][l] += A[i][j][k] * S[i][k][l];
          S[i + 1][j][l] %= B;
        }
      }
    }
  }
  for (int i = 0; i < Q; i++){
    int L, R, x, y;
    cin >> L >> R >> x >> y;
    x = mod(x, B);
    y = mod(y, B);
    vector<vector<long long>> M1 = S[R];
    vector<vector<long long>> M2 = S[L];
    swap(M2[0][0], M2[1][1]);
    M2[0][1] = mod(-M2[0][1], B);
    M2[1][0] = mod(-M2[1][0], B);
    vector<vector<long long>> P(2, vector<long long>(2, 0));
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < 2; k++){
        for (int l = 0; l < 2; l++){
          P[j][l] += M1[j][k] * M2[k][l];
          P[j][l] %= B;
        }
      }
    }
    vector<int> xx = {x, y};
    vector<long long> ans(2, 0);
    for (int j = 0; j < 2; j++){
      for (int k = 0; k < 2; k++){
        ans[j] += P[j][k] * xx[k];
        ans[j] %= B;
      }
    }
    cout << ans[0] << ' ' << ans[1] << endl;
  }
}