#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = atcoder::modint;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
#include <vector>
template<typename T>
std::vector<vector<T>> matrixMul(const std::vector<std::vector<T>>&A, const std::vector<std::vector<T>>&B) {
	std::vector<vector<T>> C(A.size(), std::vector<T>(B[0].size()));
	for (int i = 0; i < (int)A.size(); ++i) {
		for (int k = 0; k < (int)A[0].size(); ++k) {
			for (int j = 0; j < (int)B[0].size(); ++j) {
				C[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return C;
}
std::vector<vector<mint>> op(std::vector<vector<mint>>  a, std::vector<vector<mint>> b) { return matrixMul(a, b); }
std::vector<vector<mint>> e() { return { {1,0},{0,1} }; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int k, n; cin >> k >> n;
	mint::set_mod(k);
	std::vector a(n, vector(2, vector<mint>(2)));
	rep(i, n) {
		rep(j, 2)rep(k, 2) {
			int x; cin >> x;
			a[i][j][k] = x;
		}
	}
	segtree<std::vector<vector<mint>>, op, e>seg(a);
	int q; cin >> q;
	while (q--) {
		int i, l, r; cin >> i >> l >> r;
		i--, l--, r--;
		vector b(2, vector<mint>(2));
		rep(j, 2)rep(k, 2) {
			int x; cin >> x;
			b[j][k] = x;
		}
		seg.set(i, b);
		auto mat = seg.prod(l, r + 1);
		rep(i, 2) {
			rep(j, 2)cout << mat[i][j].val() << " ";
			cout << endl;
		}
	}
	return 0;
}