#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

template<class T, T (*add)(T, T), T (*zero)(), T (*mul)(T, T), T (*one)(), int N>
struct Mat : array<array<T, N>, N> {
  using M = Mat<T, add, zero, mul, one, N>;
  void make_identity() {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      (*this)[i][i] = one();
    }
  }
  M& operator+=(const M& rhs) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = add((*this)[i][j], rhs[i][j]);
      }
    }
    return *this;
  }
  M& operator*=(const M& rhs) {
    static M temp;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        temp[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        for (int k = 0; k < N; k++) {
          temp[i][k] = add(temp[i][k], mul((*this)[i][j], rhs[j][k]));
        }
      }
    }
    *this = temp;
    return *this;
  }
  template <class I>
  void inplace_pow(I k) {
    assert(k >= 0);
    static M temp;
    temp = *this;
    make_identity();
    while (k) {
      if (k & 1) *this *= temp;
      k >>= 1;
      if (k) temp *= temp;
    }
  }
  friend ostream& operator<<(ostream& os, const M& A) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        os << A[i][j] << " \n"[j + 1 == N];
      }
    }
    return os;
  }
};

unsigned int k;
unsigned int add(unsigned int x, unsigned int y) { return (x + y) % k; }
unsigned int zero() { return 0; }
unsigned int mul(unsigned int x, unsigned int y) { return 1ULL * x * y % k; }
unsigned int one() { return 1; }
using M = Mat<unsigned int, add, zero, mul, one, 2>;

M op(M x, M y) {
  x *= y;
  return x;
}
M e() {
  M m;
  m.make_identity();
  return m;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> k >> n;
  auto get_mat = []() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    a %= (int)k, b %= (int)k, c %= (int)k, d %= (int)k;
    if (a < 0) a += k;
    if (b < 0) b += k;
    if (c < 0) c += k;
    if (d < 0) d += k;
    M res;
    res[0] = {1U * a, 1U * b};
    res[1] = {1U * c, 1U * d};
    return res;
  };
  segtree<M, op, e> seg([&]() {
    vector<M> init(n);
    rep(i, n) init[i] = get_mat();
    return init;
  }());
  int q;
  cin >> q;
  while (q--) {
    int i, l, r;
    cin >> i >> l >> r;
    i--, l--;
    M y = get_mat();
    seg.set(i, y);
    M res = seg.prod(l, r);
    rep(i, 2) rep(j, 2) cout << res[i][j] << " \n"[j];
  }
}