#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;}
template<class S,S(*op)(S,S),S(*e)(),class T,S(*mapping)(T,S),T(*composition)(T,T),T(*id)()>
struct lazy_segtree{
    private:
    int N,h;
    vector<S>seg;
    vector<T>laz;
    void update(int k){seg[k]=op(seg[2*k],seg[2*k+1]);}
    
    stack<pair<int,S>>segH;
    stack<pair<int,T>>lazH;
    
    void all_apply(int k,T f){
    	segH.emplace(k,seg[k]);
        seg[k]=mapping(f,seg[k]);
        if(k<N)lazH.emplace(k,laz[k]),laz[k]=composition(f,laz[k]);
    }
    void push(int k){
        all_apply(2*k,laz[k]);
        all_apply(2*k+1,laz[k]);
        lazH.emplace(k,laz[k]);
        laz[k]=id();
    }
    public:
    lazy_segtree(int _N){init(_N);}
    void init(int _N){
        N=1,h=0;
        while(N<_N)N<<=1,h++;
        seg.assign(2*N,e());
        laz.assign(2*N,id());
    }
    void set(int i,S x){
        assert(0<=i&&i<N);
        i+=N;
        for(int k=h;k>0;k--)push(i>>k);
        segH.emplace(i,seg[i]);
        seg[i]=x;
        for(int v=i>>1;v;v>>=1)update(v);
    }
    void save(){
    	while(sz(segH))segH.pop();
    	while(sz(lazH))lazH.pop();
    }
    S get(int i){
        assert(0<=i&&i<N);
        i+=N;
        for(int k=h;k>0;k--)push(i>>k);
        for(int v=i>>1;v;v>>=1)update(v);
        return seg[i];
    }
    S prod(int l,int r){
        assert(0<=l&&l<=r&&r<=N);
        if(l==r)return e();
        l+=N;r+=N;
        for(int k=h;k>0;k--)push(l>>k);
        for(int v=l>>1;v;v>>=1)update(v);
        for(int k=h;k>0;k--)push((r-1)>>k);
        for(int v=(r-1)>>1;v;v>>=1)update(v);
        S L=e(),R=e();
        while(l<r){
            if(l&1)L=op(L,seg[l]),l++;
            if(r&1)r--,R=op(seg[r],R);
            l>>=1;
            r>>=1;
        }
        return op(L,R);
    }
    void apply(int l,int r,T f){
        assert(0<=l&&l<=r&&r<=N);
        if(l==r)return;
        l+=N;r+=N;
        for(int k=h;k>0;k--)push(l>>k);
        for(int v=l>>1;v;v>>=1)update(v);
        for(int k=h;k>0;k--)push((r-1)>>k);
        for(int v=(r-1)>>1;v;v>>=1)update(v);
        int _l=l,_r=r;
        while(l<r){
            if(l&1)all_apply(l++,f);
            if(r&1)all_apply(--r,f);
            l>>=1;
            r>>=1;
        }
        l=_l;r=_r;
        for(int k=h;k>0;k--)push(l>>k);
        for(int v=l>>1;v;v>>=1)update(v);
        for(int k=h;k>0;k--)push((r-1)>>k);
        for(int v=(r-1)>>1;v;v>>=1)update(v);
    }
    void roll_back(){
    	while(sz(segH)){
    		auto[i,v]=segH.top();segH.pop();
    		seg[i]=v;
    	}
    	while(sz(lazH)){
    		auto[i,v]=lazH.top();lazH.pop();
    		laz[i]=v;
    	}
    }
};
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 f==-1?x:pl(f*x.S,x.S);}
ll cmpo(ll f,ll g){return f==-1?g:f;}
ll id(){return -1;}
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(30*N);
  rep(i,0,N)rep(j,0,30)seg.set(N*j+i,pl((A[i]>>j)&1,1));
  seg.save();
  rep(i,1,Q+1){
  	ll s,q;cin>>s>>q;
  	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)seg.apply(N*k+u,N*k+v,1);}
  	  else{rep(k,0,30)if(!((w>>k)&1))seg.apply(N*k+u,N*k+v,0);}
  	  y=0;
  	  rep(k,0,30)y+=seg.prod(k*N+U,k*N+V).F<<k;
  	  y%=1ll<<30;
  	}
  	cout<<y<<endl;
  	seg.roll_back();
  }
  return 0;
}