#include <algorithm>
#include <cstdio>
#include <iostream>

using namespace std;

const int N = 1000010;

int n;
int m;
int type;
long long nums[N];
int leftId[N];
int rightId[N];
unsigned long long res;

namespace gen{
	typedef unsigned long long ull;
	ull s,a,b,c,lastans=0;
	ull rand(){
		return s^=(a+b*lastans)%c;
	}
};

void solve (int l, int r) {
    unsigned long long cal = 0;
    for (int i = l; i <= r; i++) {
        unsigned long long nowl = max (leftId[i], l);
        unsigned long long nowr = min (rightId[i], r);
        cal += (i - nowl + 1) * (nowr - i + 1) * nums[i];
    }
    res ^= cal;
}

int main () {
    
    freopen ("sequence.in", "r", stdin);
    freopen ("sequence.out", "w", stdout);
    
    scanf ("%d %d %d", &n, &m, &type);
    for (int i = 1; i <= n; i++) {
        scanf ("%lld", &(nums[i]));
    }
    
    for (int i = 1; i <= n; i++) {
        leftId[i] = i;
        while (leftId[i] > 1 && nums[i] <= nums[leftId[i] - 1]) {
            leftId[i] = leftId[leftId[i] - 1];
        }
    }
    
    for (int i = n; i >= 1; i--) {
        rightId[i] = i;
        while (rightId[i] < n && nums[i] <= nums[rightId[i] + 1]) {
            rightId[i] = rightId[rightId[i] + 1];
        }
    }
    
    if (type == 1) {
        cin >> gen::s >> gen::a >> gen::b >> gen::c;
    }
    
    for (int i = 1; i <= m; i++) {
        int l, r;
        if (type == 0) {
            scanf ("%d %d", &l, &r);
        }
        else {
            l=gen::rand()%n+1;
            r=gen::rand()%n+1;
            if(l>r) std::swap(l,r);
        }
        
        solve (l, r);
    }
    
    cout << res << endl;
    
    return 0;
}