#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}

ll K,N;
struct S{ll a,b,c,d;};
S op(S x,S y){
	return S{(x.a*y.a+x.b*y.c)%K,(x.a*y.b+x.b*y.d)%K,(x.c*y.a+x.d*y.c)%K,(x.c*y.b+x.d*y.d)%K};
}
S e(){
	return S{1,0,0,1};
}
vvl p(vvl A,vvl B){
	vvl C(sz(A),vl(sz(B[0])));
	rep(i,0,sz(A))rep(j,0,sz(B))rep(k,0,sz(B[0]))C[i][k]+=A[i][j]*B[j][k];
	return C;
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  cin>>K>>N;
  segtree<S,op,e>seg(N);
  rep(i,0,N){
  	ll a,b,c,d;cin>>a>>b>>c>>d;
  	a%=K;a+=K;a%=K;
  	b%=K;b+=K;b%=K;
  	c%=K;c+=K;c%=K;
  	d%=K;d+=K;d%=K;
  	seg.set(i,S{a,b,c,d});
  }
  ll Q;cin>>Q;
  while(Q--){
  	ll i,l,r,a,b,c,d;cin>>i>>l>>r>>a>>b>>c>>d;i--;l--;
  	a%=K;a+=K;a%=K;
  	b%=K;b+=K;b%=K;
  	c%=K;c+=K;c%=K;
  	d%=K;d+=K;d%=K;
  	seg.set(i,S{a,b,c,d});
  	auto x=seg.prod(l,r);
  	cout<<x.a<<" "<<x.b<<endl<<x.c<<" "<<x.d<<endl;
  }
  return 0;
}