#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 1000005
#define int long long
#define ul unsigned long long 
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,d,a[N],op,x,y,z;
int s[N],st[N],t;
int lg[N],bz[21][N];
ul ans,f[N],g[N],sf[N],sg[N];
bool type;
int fp(int a,int n,int mod){
    int ans=1;
    while(n){
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int gs(int x,int y){
    int k=lg[y-x+1];
    return a[bz[k][x]]<a[bz[k][y-(1<<k)+1]]?bz[k][x]:bz[k][y-(1<<k)+1];
}
namespace gen{
	typedef unsigned long long ull;
	ull s,a,b,c,lastans=0;
	ull rand(){
		return s^=(a+b*lastans)%c;
	}
};
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("sequence.in","r",stdin);freopen("sequence.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    n=read();m=read();type=read();
    fo(i,1,n)a[i]=read(),bz[0][i]=i;
    fo(k,1,20)
        fo(i,1,n-(1<<k)+1)
            bz[k][i]=a[bz[k-1][i]]<a[bz[k-1][i+(1<<k-1)]]?bz[k-1][i]:bz[k-1][i+(1<<k-1)];
    fo(i,2,n)lg[i]=lg[i>>1]+1;
    fo(i,1,n){
        while(t&&a[st[t]]>a[i])s[st[t--]]=i;
        st[++t]=i;
    }
    while(t)s[st[t--]]=n+1;
    rf(i,n,1)f[i]=a[i]*(s[i]-i)+f[s[i]];
    rf(i,n,1){
        while(t&&a[st[t]]>a[i])s[st[t--]]=i;
        st[++t]=i;
    }
    while(t)s[st[t--]]=0;
    fo(i,1,n)g[i]=a[i]*(i-s[i])+g[s[i]];
    fo(i,1,n)sf[i]=sf[i-1]+f[i],sg[i]=sg[i-1]+g[i];
    if(type)gen::s=read(),gen::a=read(),gen::b=read(),gen::c=read();
    while(m--){
        int l,r;
        if(type){
            l=gen::rand()%n+1;
            r=gen::rand()%n+1;
            if(l>r) std::swap(l,r);
        }
        else l=read(),r=read();
        int i=gs(l,r);
        ul sum=0;
        sum+=(ul)(i-l+1)*(r-i+1)*a[i];
        if(l<i)sum+=sf[i-1]-sf[l-1]-(i-l)*f[i];
        if(i<r)sum+=sg[r]-sg[i]-(r-i)*g[i];
        gen::lastans=sum;
        ans^=sum;
    } 
    printf("%llu",ans);
    return 0;
}