#include<bits/stdc++.h>
using namespace std;
template<typename T>
pair<vector<T>,long long> operator+(const pair<vector<T>,long long> &a,const pair<vector<T>,long long> &b)
{
	auto c=a.first;
	c.insert(c.end(),b.first.begin(),b.first.end());
	return make_pair(c,a.second+b.second);
}
int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);
	unsigned SA,SB,SC;int lim;
	auto getweight=[&]()
	{
		SA ^= SA << 16;
		SA ^= SA >> 5;
		SA ^= SA << 1;
		unsigned t = SA;
		SA = SB;
		SB = SC;
		SC ^= t ^ SA;
		return SC % lim + 1;
	};
	int n,m;
	cin>>n>>m>>SA>>SB>>SC>>lim;
	auto hs=[&](int x,int y){return x+(y-1)*n;};
	vector<vector<tuple<int,int,int>>> edgeH(m+5),edgeV(m+5);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			int w=getweight();
			if(j<m)edgeH[j].emplace_back(hs(i,j),hs(i,j+1),w);
			else edgeH[j].emplace_back(hs(i,j),hs(i,1),w);
		}
	for(int i=1;i<n;i++)
		for(int j=1;j<=m;j++)
		{
			int w=getweight();
			edgeV[j].emplace_back(hs(i,j),hs(i+1,j),w);
		}
	vector<int> mark(n*m+5),pa(n*m+5);
	vector<vector<pair<int,int>>> G(n*m+5);
	function<int(int)> find=[&](int x){return pa[x]?pa[x]=find(pa[x]):x;};
	auto mst=[&](const auto &info)
	{
		auto edges=info.first;
		long long ex=info.second;
		sort(edges.begin(),edges.end(),[&](const auto &x,const auto &y){return get<2>(x)<get<2>(y);});
		vector<int> sp;
		for(auto [u,v,w]:edges)
		{
			pa[u]=pa[v]=0;
			sp.push_back(u);sp.push_back(v);
			G[u].clear();G[v].clear();
		}
		sort(sp.begin(),sp.end());
		sp.resize(unique(sp.begin(),sp.end())-sp.begin());
//		cerr<<"calling mst, ex = "<<ex<<endl;
		for(auto [u,v,w]:edges)
		{
//			cerr<<"edge "<<u<<' '<<v<<' '<<w<<endl;
			int pu=find(u),pv=find(v);
			if(pu!=pv)
			{
				pa[pv]=pu;
				G[u].emplace_back(v,w);
				G[v].emplace_back(u,w);
			}
		}
		for(auto u:sp)
		{
			if(not mark[u] and G[u].size()==2)
			{
				auto it1=G[u].begin();
				auto it2=next(it1);
				int v1=it1->first,v2=it2->first;
				int w=max(it1->second,it2->second);
				ex+=min(it1->second,it2->second);
				G[u].clear();
				for(auto it=G[v1].begin();it!=G[v1].end();++it){if(it->first==u){it->first=v2;it->second=w;break;}}
				for(auto it=G[v2].begin();it!=G[v2].end();++it){if(it->first==u){it->first=v1;it->second=w;break;}}
			}
			else if(not mark[u] and G[u].size()==1)
			{
				auto it1=G[u].begin();
				int v=it1->first;
				ex+=it1->second;
				G[u].clear();
				for(auto it=G[v].begin();it!=G[v].end();++it){if(it->first==u){G[v].erase(it);break;}}
			}
		}
		vector<tuple<int,int,int>> ret;
		for(auto u:sp)
		{
			for(const auto &[v,w]:G[u])
			{
				if(u<v)
				{
					ret.emplace_back(u,v,w);
	//				cerr<<"return edge "<<pr.first<<' '<<pr.second<<' '<<w<<endl;
				}
			}
		}
//		cerr<<"return ex = "<<ex<<endl;
		return make_pair(ret,ex);
	};
	vector<pair<vector<tuple<int,int,int>>,long long>> pre(m+5),suf(m+5);
	for(int i=1;i<=n;i++)mark[hs(i,m)]=1;
	for(int j=1;j<m;j++)
	{
		for(int i=1;i<=n;i++)mark[hs(i,j)]=1;
		if(j==1)pre[j]=mst(make_pair(edgeV[1],0ll)+make_pair(edgeV[m],0ll)+make_pair(edgeH[m],0ll));
		else pre[j]=mst(pre[j-1]+make_pair(edgeV[j],0ll)+make_pair(edgeH[j-1],0ll));
		for(int i=1;i<=n;i++)mark[hs(i,j)]=0;
	}
	suf[m]=make_pair(edgeV[m],0);
	for(int j=m-1;j>1;j--)
	{
		for(int i=1;i<=n;i++)mark[hs(i,j)]=1;
		suf[j]=mst(suf[j+1]+make_pair(edgeV[j],0ll)+make_pair(edgeH[j],0ll));
		for(int i=1;i<=n;i++)mark[hs(i,j)]=0;
	}
	int q;
	cin>>q;
//	mt19937 rng(58);
	while(q--)
	{
		int l,r;
//		l=rng()%(m-2)+2;r=rng()%(m-2)+2;
//		if(l>r)swap(l,r);
		cin>>l>>r;
		auto info=mst(pre[l-1]+suf[r+1]);
		long long ans=info.second;
		for(auto z:info.first)ans+=get<2>(z);
		cout<<ans<<"\n";
	}
	return 0;
}