#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;}
pl op(pl x,pl y){return pl(x.F+y.F,x.S+y.S);}
pl e(){return pl(0,0);}
pl mpp(ll f,pl x){return pl(x.F+f*x.S,x.S);}
ll cmpo(ll f,ll g){return f+g;}
ll id(){return 0;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M;cin>>N>>M;
  vl A(N),l(M),r(M),x(M),L(M),R(M);cin>>A>>l>>r>>x>>L>>R;
  ll Q;cin>>Q;
  lazy_segtree<pl,op,e,ll,mpp,cmpo,id>seg(N);
  rep(i,0,N)seg.set(i,pl(A[i],1));
  vector<set<pl>>B(30);
  rep(i,0,30){
  	vl _A(N);
  	rep(j,0,N)_A[j]=(A[j]>>i)&1;
  	rep(j,0,N)if(j==0||_A[j-1]!=_A[j])B[i].emplace(j,_A[j]);
  	B[i].emplace(N,-1);
  }
  rep(i,1,Q+1){
  	ll s,q;cin>>s>>q;
  	
  	stack<ppl>BH,segH;
  	auto add=[&](ll k,ll pos,ll val){
  	  BH.emplace(k,pl(pos,val));
  	  B[k].emplace(pos,val);
  	};
  	auto del=[&](ll k,ll pos,ll val){
  	  BH.emplace(-1-k,pl(pos,val));
  	  B[k].erase(pl(pos,val));
  	};
  	auto app=[&](ll l,ll r,ll x){
  	  // cerr<<i<<"th add : "<<l<<" "<<r<<" "<<x<<endl;
  	  seg.apply(l,r,x);
  	  segH.emplace(l,pl(r,x));
  	};
  	
  	ll y=i;
  	rep(j,1,q+1){
  	  ll z=(s+j)%M;
  	  ll u=min(N,max(1ll,l[z]^y));
  	  ll v=min(N,max(1ll,r[z]^y));
  	  ll U=min(N,max(1ll,L[z]^y));
  	  ll V=min(N,max(1ll,R[z]^y));
  	  if(u>v)swap(u,v);
  	  if(U>V)swap(U,V);
  	  u--;U--;
  	  ll w=x[z]^y;
  	  if(z&1){
  	  	rep(k,0,30)if((w>>k)&1){
  	  	  auto it=prev(B[k].lower_bound(pl(u+1,-1e18)));
  	  	  if((*it).S==0){
  	  	  	ll l=(*it).F,r=(*next(it)).F;
  	  	  	app(u,min(r,v),1<<k);
  	  	  	if(l<u)add(k,u,1);
  	  	  	else{
  	  	  	  del(k,u,0);
  	  	  	  if(u==0)add(k,0,1);
  	  	  	}
  	  	  	if(r<=v)del(k,r,1);
  	  	  	else add(k,v,0);
  	  	  }
  	  	  it=B[k].lower_bound(pl(u,-1e18));
  	  	  while((*it).F<v){
  	  	  	if((*it).S==1)it++;
  	  	  	else{
  	  	  	  assert((*it).S==0);
  	  	  	  ll l=(*it).F,r=(*next(it)).F;
  	  	  	  app(l,min(r,v),1<<k);
  	  	  	  del(k,l,0);
  	  	  	  if(l==0)add(k,0,1);
  	  	  	  if(r<=v)del(k,r,1);
  	  	  	  else add(k,v,0);
  	  	  	  it=B[k].lower_bound(pl(u,-1e18));
  	  	  	}
  	  	  }
  	  	}
  	  }
  	  else{
  	  	rep(k,0,30)if(!((w>>k)&1)){
  	  	  auto it=prev(B[k].lower_bound(pl(u+1,-1e18)));
  	  	  if((*it).S==1){
  	  	  	ll l=(*it).F,r=(*next(it)).F;
  	  	  	app(u,min(r,v),-(1<<k));
  	  	  	if(l<u)add(k,u,0);
  	  	  	else{
  	  	  	  del(k,u,1);
  	  	  	  if(u==0)add(k,0,0);
  	  	  	}
  	  	  	if(r<=v)del(k,r,0);
  	  	  	else add(k,v,1);
  	  	  }
  	  	  it=B[k].lower_bound(pl(u,-1e18));
  	  	  while((*it).F<v){
  	  	  	if((*it).S==0)it++;
  	  	  	else{
  	  	  	  assert((*it).S==1);
  	  	  	  ll l=(*it).F,r=(*next(it)).F;
  	  	  	  app(l,min(r,v),-(1<<k));
  	  	  	  del(k,l,1);
  	  	  	  if(l==0)add(k,0,0);
  	  	  	  if(r<=v)del(k,r,0);
  	  	  	  else add(k,v,1);
  	  	  	  it=B[k].lower_bound(pl(u,-1e18));
  	  	  	}
  	  	  }
  	  	}
  	  }
  	  y=seg.prod(U,V).F;
  	  y%=1ll<<30;
  	}
  	// cout<<"seg : "<<endl;
  	// rep(i,0,N)cout<<seg.get(i).F<<" ";cout<<endl;
  	cout<<y<<endl;
  	while(sz(BH)){
  	  auto[k,p]=BH.top();BH.pop();
  	  if(k<0)B[-1-k].emplace(p);
  	  else B[k].erase(p);
  	}
  	while(sz(segH)){
  	  auto[l,p]=segH.top();segH.pop();
  	  auto[r,x]=p;
  	  seg.apply(l,r,-x);
  	}
  }
  return 0;
}