#define ATCODER #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define VL vector #define VVL vector> #define VP vector< pair > #define VVP vector>> #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define MP(a,b) make_pair(a,b) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } template T det2(array ar) { return ar[0] * ar[3] - ar[1] * ar[2]; } template T det3(array ar) { return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6]; } template bool chmax(T& tar, T src) { return tar < src ? tar = src, true : false; } template bool chmin(T& tar, T src) { return tar > src ? tar = src, true : false; } template void inc(vector& ar) { for (auto& v : ar) v++; } template void dec(vector& ar) { for (auto& v : ar) v--; } template vector> id_sort(vector& a) { vector res(a.size()); for (int i = 0; i < a.size(); i++)res[i] = MP(a[i], i); SORT(res); return res; } using val = array; using func = pair; ll k; val op(val a, val b) { return { (a[0] * b[0] + a[1] * b[2])%k, (a[0] * b[1] + a[1] * b[3])%k, (a[2] * b[0] + a[3] * b[2])%k, (a[2] * b[1] + a[3] * b[3])%k}; } val e() { return { 1,0,0,1 }; } //val mp(func f, val a) { // if (f.second) { // return MP(a.second * f.first, a.second); // } // else { // return a; // } //} //func comp(func f, func g) { // if (!f.second)return g; // return f; //} //func id() { return MP(0, false); } // Rook ll dxr[4] = { 1,0,-1,0 }; ll dyr[4] = { 0,1,0,-1 }; // Bishop ll dxb[4] = { -1,-1,1,1 }; ll djb[4] = { -1,1,-1,1 }; // qween ll dxq[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dyq[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n; cin >> k >> n; segtree st(n); REP(i, n) { array ar; REP(j, 4) { cin >> ar[j]; ar[j] %= k; ar[j] += k; ar[j] %= k; } st.set(i, ar); } ll q; cin >> q; while (q--) { ll ii, l, r; cin >> ii >> l >> r; ii--; l--; array ar; REP(j, 4) { cin >> ar[j]; ar[j] %= k; ar[j] += k; ar[j] %= k; } st.set(ii, ar); auto ans = st.prod(l, r); cout << ans[0] << " "; cout << ans[1] << "\n"; cout << ans[2] << " "; cout << ans[3] << "\n"; } } int main() { ll t = 1; // cin >> t; while (t--) { solve(); } return 0; }