//これは、一様乱数の性質を大いに利用した嘘解法です。（BITを構築したら間に合うのかなあ…）
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;
using ull = unsigned long long;

ull seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}

int n, q;
int a[200000];

int getCnt(int x) {
	int expect = (long long)x * n / (1LL << 31);
	int st = max(-1, expect - 1000), ed = min(n, expect + 1000), mid;	//oooxxx, [st, ed)
	while (ed - st >= 2) {
		mid = (st + ed) / 2;
		if (a[mid] < x) st = mid;
		else ed = mid;
	}
	return st + 1;
}

int main() {
    cin >> n >> q >> seed;
    for (int i = 0; i < 10000; i++) next();
    
    for (int i = 0; i < n; i++) a[i] = next();
	sort(a, a + n);
	
    ll sm = 0;
    for (int i = 0; i < q; i++) {
        int x = next();
        int cnt = getCnt(x);
        sm ^= ll(cnt) * i;
    }
    cout << sm << endl;
    return 0;
}