#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=;

struct edge{int u,v,w;};

bool operator<(edge a,edge b){return a.w<b.w;}

int n,m,Q,lim,tot,cnt,d1[N][],d2[N][],fa[N],hd[N],v[N],nxt[N],w[N],vis[N];

ll ans;

unsigned int SA,SB,SC;

vector<edge>G;

struct MST{

    int tot;ll sum;

    vector<edge>G;

    MST(){}

    MST(int*c)

    {

        tot=n,sum=;

        for(int i=;i<n;i++)G.push_back((edge){i,i+,c[i]});

    }

}pre[N],suf[N];

int getweight()

{

    SA^=SA<<,SA^=SA>>,SA^=SA<<;

    unsigned int t=SA;

    SA=SB,SB=SC,SC^=t^SA;

    return SC%lim+;

}

int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}

void adde(edge x)

{

    v[++cnt]=x.v,nxt[cnt]=hd[x.u],w[cnt]=x.w,hd[x.u]=cnt;

    v[++cnt]=x.u,nxt[cnt]=hd[x.v],w[cnt]=x.w,hd[x.v]=cnt;

    ans+=x.w;

}

bool dfs1(int u,int f)

{

    int ret=;

    for(int i=hd[u];i;i=nxt[i])if(v[i]!=f)ret+=dfs1(v[i],u);

    vis[u]|=(ret>=),ret+=vis[u];

    return ret;

}

void dfs2(int u,int f,int lst,int val)

{

    if(vis[u])

    {

        if(lst)G.push_back((edge){vis[u],lst,val});

        lst=vis[u],ans-=val,val=;

    }

    for(int i=hd[u];i;i=nxt[i])if(v[i]!=f)dfs2(v[i],u,lst,max(val,w[i]));

}

MST merge(MST a,MST b,int*c)

{

    G.clear(),tot=a.tot+b.tot;

    for(int i=;i<a.G.size();i++)G.push_back(a.G[i]);

    for(int i=;i<b.G.size();i++)G.push_back((edge){b.G[i].u+a.tot,b.G[i].v+a.tot,b.G[i].w});

    for(int i=;i<=n;i++)G.push_back((edge){a.tot-n+i,a.tot+i,c[i]});

    sort(G.begin(),G.end());

    for(int i=;i<=tot;i++)fa[i]=i,vis[i]=(i<=n||i>tot-n),hd[i]=;

    ans=cnt=;

    for(int i=;i<G.size();i++)

    {

        int u=find(G[i].u),v=find(G[i].v);

        if(u!=v)adde(G[i]),fa[u]=v;

    }

    dfs1(,),cnt=;

    for(int i=;i<=tot;i++)if(vis[i])vis[i]=++cnt;

    G.clear(),dfs2(,,,);

    MST ret;ret.tot=cnt,ret.sum=a.sum+b.sum+ans,ret.G=G;

    return ret;

}

ll query(MST a)

{

    ll ret=a.sum;

    for(int i=;i<a.G.size();i++)ret+=a.G[i].w;

    return ret;

}

int main()

{

    scanf("%d%d%u%u%u%d",&n,&m,&SA,&SB,&SC,&lim);

    for(int i=;i<=n;i++)for(int j=;j<=m;j++)d1[j][i]=getweight();

    for(int i=;i<n;i++)for(int j=;j<=m;j++)d2[j][i]=getweight();

    pre[]=MST(d2[]),suf[m]=MST(d2[m]);

    for(int i=;i<m;i++)pre[i]=merge(pre[i-],MST(d2[i]),d1[i-]);

    for(int i=m-;i>;i--)suf[i]=merge(MST(d2[i]),suf[i+],d1[i]);

    scanf("%d",&Q);

    while(Q--)

    {

        int l,r;scanf("%d%d",&l,&r);

        printf("%lld\n",query(merge(suf[r+],pre[l-],d1[m])));

    }

}