#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
typedef unsigned int uint32;
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 10005
#define inf 0x3f3f3f3f

uint32 SA,SB,SC;int lim;
inline int rnd(){
    SA^=SA<<16;SA^=SA>>5;SA^=SA<<1;
    uint32 t=SA;SA=SB;SB=SC;SC^=t^SA;
    return SC%lim+1;
}

int n,m;
int a[maxn][105],dw[maxn][105];

int fa[maxn];
inline int getf(int x){
	while(x^fa[x])x=fa[x]=fa[fa[x]];
	return x;
}

struct edge{
	int u,v,w;
	bool operator <(const edge&b)const{return w<b.w;}
};

struct mst{
	vector<edge>e;
	int n,sum;
	inline int ask(){
		int res=sum;
		for(auto t:e)res+=t.w;
		return res;
	}
}pre[maxn],suf[maxn];

int tot;
vector<edge>e;
vector<pii>g[maxn];

inline void adde(int u,int v,int w){
	g[u].pb(mkp(v,w)),g[v].pb(mkp(u,w));
}

vector<edge>chose;
int sumw,cnt;
bool vis[maxn];
int col[maxn];

bool getvis(int u,int pa){
	int s=0;
	for(auto it:g[u]){
		int v=it.fi;
		if(v!=pa) s+=getvis(v,u);
	}
	if(s>=2) vis[u]=1;
	s+=vis[u];
	return (s>=0);
}

void dfs(int u,int pa,int lst,int lstw)
{
	if(vis[u]){
		if(lst) chose.pb((edge){col[u],lst,lstw});
		lst=col[u],sumw-=lstw,lstw=0;
	}
	for(auto it:g[u]){
		int v=it.fi;
		if(v!=pa) dfs(v,u,lst,max(lstw,it.se));
	}
}

mst merge(mst a,mst b,int*c)
{
	// 只保留左右关键点的 mst虚树上最大边 
	tot=a.n+b.n; e.clear();
	for(auto t:a.e) e.pb(t);
	for(auto t:b.e) e.pb((edge){t.u+a.n,t.v+a.n,t.w});
	For(i,1,n) e.pb((edge){a.n-n+i,a.n+i,c[i]});
	sort(e.begin(),e.end());
	
	For(i,1,tot) fa[i]=i,vis[i]=(i<=n||i>=tot-n+1),g[i].clear();
	
	chose.clear(),sumw=cnt=0;
	for(auto t:e)
		if(getf(t.u)!=getf(t.v))
			fa[getf(t.u)]=getf(t.v),adde(t.u,t.v,t.w),sumw+=t.w;
	
	getvis(1,0);
	For(i,1,tot)
		if(vis[i]) col[i]=++cnt;
	dfs(1,0,0,0);
	
	mst ret;
	ret.n=cnt; ret.sum=a.sum+b.sum+sumw;
	ret.e=chose; return ret;
}

mst getmst(int *a){
	mst ret;
	ret.n=n,ret.sum=0;
	For(i,1,n-1) ret.e.pb((edge){i,i+1,a[i]});
	return ret;
}

signed main()
{
	cin>>n>>m>>SA>>SB>>SC>>lim;
	For(i,1,n)
		For(j,1,m) a[j][i]=rnd();
	For(i,1,n-1)
		For(j,1,m) dw[j][i]=rnd();
	
	pre[1]=getmst(dw[1]);
	For(i,2,m-1)
		pre[i]=merge(pre[i-1],getmst(dw[i]),a[i-1]);
	suf[m]=getmst(dw[m]);
	Rep(i,m-1,2)
		suf[i]=merge(getmst(dw[i]),suf[i+1],a[i]);
	
	int Q=read();
	while(Q--)
	{
		int l=read(),r=read();
		printf("%lld\n",(merge(suf[r+1],pre[l-1],a[m])).ask());
	}
	return 0;
}