#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);
	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-1)*m+y;};
	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),deg(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(),[&](auto x,auto y){return get<2>(x)<get<2>(y);});
		vector<int> sp;
		for(auto [u,v,w]:edges)pa[u]=pa[v]=deg[u]=deg[v]=0,sp.push_back(u),sp.push_back(v);
		sort(sp.begin(),sp.end());
		sp.resize(unique(sp.begin(),sp.end())-sp.begin());
		map<pair<int,int>,int> mp;
//		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;
				deg[u]++;deg[v]++;
				mp[{u,v}]=w;mp[{v,u}]=w;
			}
		}
		for(auto u:sp)
		{
			if(not mark[u] and deg[u]==2)
			{
				auto it1=mp.lower_bound({u,0});
				auto it2=next(it1);
				int v1=it1->first.second,v2=it2->first.second;
				int w=max(it1->second,it2->second);
				ex+=min(it1->second,it2->second);
				mp.erase({u,v1});mp.erase({v1,u});
				mp.erase({u,v2});mp.erase({v2,u});
				mp[{v1,v2}]=mp[{v2,v1}]=w;
				deg[u]=0;
			}
			else if(not mark[u] and deg[u]==1)
			{
				auto it1=mp.lower_bound({u,0});
				int v=it1->first.second;
				ex+=it1->second;
				mp.erase({u,v});mp.erase({v,u});
				deg[v]--;
				deg[u]=0;
			}
		}
		vector<tuple<int,int,int>> ret;
		for(const auto &[pr,w]:mp)
		{
			if(pr.first<pr.second)
			{
				ret.emplace_back(pr.first,pr.second,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++)
	{
//		if(j%100==0)cerr<<"pre "<<j<<endl;
		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;
//		if(j%100==0)cerr<<"edge# "<<pre[j].first.size()<<endl;
	}
	suf[m]=make_pair(edgeV[m],0);
	for(int j=m-1;j>1;j--)
	{
//		if(j%100==0)cerr<<"suf "<<j<<endl;
		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;
	while(q--)
	{
		int 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<<endl;
	}
	return 0;
}