#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
unsigned int SA, SB, SC;int lim,n,m;
int getweight() {
    SA ^= SA << 16;
    SA ^= SA >> 5;
    SA ^= SA << 1;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC % lim + 1;
}
ll dis[105][10005][2];
void init(){
	int i, j, w;
    for(i = 1; i <= n; i++)
        for(j = 1; j <= m; j++) {
            w = getweight();
            dis[i][j][0]=w;
//            cout<<i<<" "<<j<<" "<<0<<" "<<w<<endl;
        }
    for(i = 1; i < n; i++)
        for(j = 1; j <= m; j++) {
            w = getweight();
            dis[i][j][1]=w;
//            cout<<i<<" "<<j<<" "<<1<<" "<<w<<endl;
        }
}
struct node{
	int to;
	ll val;
	node(int to_,ll val_){
		to=to_,val=val_;
	}
};
struct bcj{
	int fath[100005];
	int get_fath(int i){
		if(i==fath[i])return i;
		return fath[i]=get_fath(fath[i]);
	}
}b;
struct edge{
	int x,y;
	ll z;
	edge(){}
	edge(int x_,int y_,ll z_){
		x=x_,y=y_,z=z_;
	}
}arr[1005];
int tt;
bool cmp(edge x,edge y){
	return x.z<y.z;
}
bool merge(int x,int y){
	int fx=b.get_fath(x),fy=b.get_fath(y);
//	cout<<x<<" "<<y<<" "<<fx<<" "<<fy<<endl;
	if(fx==fy)return 0;
	b.fath[fx]=fy;
	return 1;
}
struct MST{
	int nid[205],cnt;
	ll ans;
	vector<node>vec[405];
}suf[10005],pre[10005];
vector<node>vec1[505],vec2[505];
int fath[505][11],in[505],tim,dep[505];
ll mx[505][11];
int stk[505];
void dfs1(int now,int fa,ll val){
//	cout<<now<<" "<<fa<<" "<<val<<endl;
	fath[now][0]=fa;
	mx[now][0]=val;
	in[now]=++tim;
	for(int i=1;i<=7;i++){
		fath[now][i]=fath[fath[now][i-1]][i-1];
		mx[now][i]=max(mx[now][i-1],mx[fath[now][i-1]][i-1]);
	}
	dep[now]=dep[fa]+1;
	for(auto to:vec1[now]){
		if(to.to==fa)continue;
		dfs1(to.to,now,to.val);
	}
}
int lca(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	for(int i=7;i>=0;i--){
		if(dep[fath[x][i]]>=dep[y])x=fath[x][i];
	}
	if(x==y)return x;
	for(int i=7;i>=0;i--){
		if(fath[x][i]!=fath[y][i])x=fath[x][i],y=fath[y][i];
	}
	return fath[x][0];
}
ll Getdis(int x,int y){
	ll res=0;
	if(dep[x]<dep[y])swap(x,y);
	for(int i=7;i>=0;i--){
		if(dep[fath[x][i]]>=dep[y])res=max(res,mx[x][i]),x=fath[x][i];
	}
	if(x==y)return res;
	for(int i=7;i>=0;i--){
		if(fath[x][i]!=fath[y][i]){
			res=max(res,mx[x][i]),x=fath[x][i];
			res=max(res,mx[y][i]),y=fath[y][i];
		}
	}
	res=max(res,mx[x][0]),res=max(res,mx[y][0]);
	return res;
}
int a[205],tot,c[505],dy[505],st[505],pos[505];
bool cmp1(int x,int y){
	return in[x]<in[y];
}
int main(){
//	freopen("data.in","r",stdin);
//	freopen("WA.out","w",stdout);
	scanf("%d%d%u%u%u%d", &n, &m, &SA, &SB, &SC, &lim);
	init();
	pre[1].cnt=n;
	for(int i=1;i<=n;i++){
		pre[1].nid[i]=pre[1].nid[i+n]=i;
		if(i!=n){
			pre[1].vec[i].push_back(node(i+1,dis[i][1][1]));
			pre[1].vec[i+1].push_back(node(i,dis[i][1][1]));
			pre[1].ans+=dis[i][1][1];
		}
	}
	for(int i=2;i<=m;i++){
		tt=0;
		pre[i].ans=pre[i-1].ans;
		for(int j=1;j<n;j++)arr[++tt]=edge(pre[i-1].cnt+j,pre[i-1].cnt+j+1,dis[j][i][1]),pre[i].ans+=dis[j][i][1];
		for(int j=1;j<=n;j++)arr[++tt]=edge(pre[i-1].cnt+j,pre[i-1].nid[j+n],dis[j][i-1][0]),pre[i].ans+=dis[j][i-1][0];
		for(int j=1;j<=pre[i-1].cnt;j++){
			for(auto to:pre[i-1].vec[j]){
				if(j<to.to)arr[++tt]=edge(j,to.to,to.val);
			}
		}
		sort(arr+1,arr+1+tt,cmp);
		for(int j=1;j<=pre[i-1].cnt+n;j++){
			pos[j]=0;
			vec1[j].clear();
			b.fath[j]=j;
			for(int k=0;k<=7;k++)fath[j][k]=0,mx[j][k]=0;
		}
		for(int j=1;j<=tt;j++){
//			cout<<arr[j].z<<" "<<arr[j].x<<" "<<arr[j].y<<endl;
			if(merge(arr[j].x,arr[j].y)){
				vec1[arr[j].x].push_back(node(arr[j].y,arr[j].z));
				vec1[arr[j].y].push_back(node(arr[j].x,arr[j].z));
				continue;
			}
			pre[i].ans-=arr[j].z;
		}
//		cout<<endl;
		tim=0;
		dfs1(1,0,0);tot=0;
//		cout<<endl;
		for(int j=1;j<=n;j++){
			a[++tot]=pre[i-1].nid[j];
			pos[a[tot]]=j;
			a[++tot]=pre[i-1].cnt+j;
		}
		sort(a+1,a+1+tot,cmp1);
		int tp=0;
		st[++tp]=1;
		for(int j=1;j<=pre[i-1].cnt+n;j++)c[j]=0,vec2[j].clear(),dy[j]=0;
		for(int j=1;j<=tot;j++){
			int l=lca(st[tp],a[j]);
//			cout<<"lca:"<<st[tp]<<" "<<a[j]<<" "<<l<<endl;
			if(c[l]!=i)c[l]=i;
			while(1){
				if(dep[st[tp-1]]<=dep[l]){
					if(l!=st[tp]){
						vec2[l].push_back(node(st[tp],Getdis(st[tp],l)));
						vec2[st[tp]].push_back(node(l,Getdis(st[tp],l)));
					}
					tp--;
					if(st[tp]!=l)st[++tp]=l;
					break;
				}
				vec2[st[tp-1]].push_back(node(st[tp],Getdis(st[tp-1],st[tp])));
				vec2[st[tp]].push_back(node(st[tp-1],Getdis(st[tp-1],st[tp])));
				tp--;
			}
			if(st[tp]!=a[j])st[++tp]=a[j];
		}
		for(int j=1;j<tp;j++){
			vec2[st[j]].push_back(node(st[j+1],Getdis(st[j+1],st[j])));
			vec2[st[j+1]].push_back(node(st[j],Getdis(st[j+1],st[j])));
		}
//		for(int j=1;j<=4;j++){
//			for(auto to:vec2[j])cout<<j<<" "<<to.to<<' '<<to.val<<endl;
//		}
//		cout<<endl;
		for(int j=1;j<=pre[i-1].cnt+n;j++){
			for(auto to:vec2[j]){
				if(!dy[j]){
					dy[j]=++pre[i].cnt;
					if(j>pre[i-1].cnt)pre[i].nid[j-pre[i-1].cnt+n]=pre[i].cnt;
					if(pos[j])pre[i].nid[pos[j]]=pre[i].cnt;
				}
				if(!dy[to.to]){
					dy[to.to]=++pre[i].cnt;
					if(to.to>pre[i-1].cnt)pre[i].nid[to.to-pre[i-1].cnt+n]=pre[i].cnt;
					if(pos[to.to])pre[i].nid[pos[to.to]]=pre[i].cnt;
				}
				pre[i].vec[dy[j]].push_back(node(dy[to.to],to.val));
			}
		}
	}
	
	suf[m].cnt=n;
	for(int i=1;i<=n;i++){
		suf[m].nid[i]=suf[m].nid[i+n]=i;
		if(i!=n){
			suf[m].vec[i].push_back(node(i+1,dis[i][m][1]));
			suf[m].vec[i+1].push_back(node(i,dis[i][m][1]));
			suf[m].ans+=dis[i][m][1];
		}
	}
	for(int i=m-1;i;i--){
//		cout<<i<<" ";
		tt=0;
		suf[i].ans=suf[i+1].ans;
		for(int j=1;j<n;j++)arr[++tt]=edge(suf[i+1].cnt+j,suf[i+1].cnt+j+1,dis[j][i][1]),suf[i].ans+=dis[j][i][1];
		for(int j=1;j<=n;j++)arr[++tt]=edge(suf[i+1].cnt+j,suf[i+1].nid[j+n],dis[j][i][0]),suf[i].ans+=dis[j][i][0];
		for(int j=1;j<=suf[i+1].cnt;j++){
			for(auto to:suf[i+1].vec[j]){
				if(j<to.to)arr[++tt]=edge(j,to.to,to.val);
			}
		}
		sort(arr+1,arr+1+tt,cmp);
		for(int j=1;j<=suf[i+1].cnt+n;j++){
			pos[j]=0;
			vec1[j].clear();
			b.fath[j]=j;
			for(int k=0;k<=7;k++)fath[j][k]=0,mx[j][k]=0;
		}
		for(int j=1;j<=tt;j++){
//			if(i==m-1)cout<<arr[j].x<<" "<<arr[j].y<<" "<<arr[j].z<<endl;
			if(merge(arr[j].x,arr[j].y)){
				vec1[arr[j].x].push_back(node(arr[j].y,arr[j].z));
				vec1[arr[j].y].push_back(node(arr[j].x,arr[j].z));
				continue;
			}
			suf[i].ans-=arr[j].z;
		}
		tim=0;
		dfs1(1,0,0);tot=0;
		for(int j=1;j<=n;j++){
			a[++tot]=suf[i+1].nid[j];
			pos[a[tot]]=j;
			a[++tot]=suf[i+1].cnt+j;
		}
		sort(a+1,a+1+tot,cmp1);
		int tp=0;
		st[++tp]=1;
		for(int j=1;j<=suf[i+1].cnt+n;j++)c[j]=0,vec2[j].clear(),dy[j]=0;
		for(int j=1;j<=tot;j++){
			int l=lca(st[tp],a[j]);
			if(c[l]!=i)c[l]=i;
			while(1){
				if(dep[st[tp-1]]<=dep[l]){
					if(l!=st[tp]){
						vec2[l].push_back(node(st[tp],Getdis(st[tp],l)));
						vec2[st[tp]].push_back(node(l,Getdis(st[tp],l)));
					}
					tp--;
					if(st[tp]!=l)st[++tp]=l;
					break;
				}
				vec2[st[tp-1]].push_back(node(st[tp],Getdis(st[tp-1],st[tp])));
				vec2[st[tp]].push_back(node(st[tp-1],Getdis(st[tp-1],st[tp])));
				tp--;
			}
			if(st[tp]!=a[j])st[++tp]=a[j];
		}
		for(int j=1;j<tp;j++){
			vec2[st[j]].push_back(node(st[j+1],Getdis(st[j+1],st[j])));
			vec2[st[j+1]].push_back(node(st[j],Getdis(st[j+1],st[j])));
		}
		for(int j=1;j<=suf[i+1].cnt+n;j++){
			for(auto to:vec2[j]){
				if(!dy[j]){
					dy[j]=++suf[i].cnt;
					if(j>suf[i+1].cnt)suf[i].nid[j-suf[i+1].cnt+n]=suf[i].cnt;
					if(pos[j])suf[i].nid[pos[j]]=suf[i].cnt;
				}
				if(!dy[to.to]){
					dy[to.to]=++suf[i].cnt;
					if(to.to>suf[i+1].cnt)suf[i].nid[to.to-suf[i+1].cnt+n]=suf[i].cnt;
					if(pos[to.to])suf[i].nid[pos[to.to]]=suf[i].cnt;
				}
				suf[i].vec[dy[j]].push_back(node(dy[to.to],to.val));
			}
		}
	}
//	for(int i=1;i<=m;i++){
//		cout<<pre[i].ans<<endl;
//		for(int j=1;j<=n;j++)cout<<pre[i].nid[j]<<" ";puts("");
//		for(int j=1;j<=pre[i].cnt;j++){
//			for(auto to:pre[i].vec[j]){
//				cout<<j<<" "<<to.to<<" "<<to.val<<endl;
//			}
//		}
//		cout<<endl;
//	}
//	puts("---------");
//	for(int i=m;i;i--){
//		cout<<suf[i].ans<<endl;
//		for(int j=1;j<=n;j++)cout<<suf[i].nid[j]<<" ";puts("");
//		for(int j=1;j<=suf[i].cnt;j++){
//			for(auto to:suf[i].vec[j]){
//				cout<<j<<" "<<to.to<<" "<<to.val<<endl;
//			}
//		}
//		cout<<endl;
//	}
	int q;
	scanf("%d",&q);
	while(q--){
		int l,r;
		scanf("%d%d",&l,&r);
		tt=0;
		ll ans=pre[l-1].ans+suf[r+1].ans;
		for(int i=1;i<=n;i++){
			ans+=dis[i][m][0];
			arr[++tt]=edge(suf[r+1].nid[i]+pre[l-1].cnt,pre[l-1].nid[i],dis[i][m][0]);
		}
//		cout<<ans<<" ";
		for(int i=1;i<=pre[l-1].cnt;i++){
			for(auto to:pre[l-1].vec[i]){
				if(to.to<i){
					arr[++tt]=edge(i,to.to,to.val);
				}
			}
		}
		for(int i=1;i<=suf[r+1].cnt;i++){
			for(auto to:suf[r+1].vec[i]){
				if(to.to<i){
					arr[++tt]=edge(i+pre[l-1].cnt,to.to+pre[l-1].cnt,to.val);
				}
			}
		}
		for(int i=1;i<=pre[l-1].cnt+suf[r+1].cnt;i++)b.fath[i]=i;
		sort(arr+1,arr+1+tt,cmp);
		for(int i=1;i<=tt;i++){
			if(merge(arr[i].x,arr[i].y))continue;
			ans-=arr[i].z;
		}
		printf("%lld\n",ans);
	}
	return 0;
}