#include <iostream>
#include <vector>
using namespace std;

unsigned long long seed;

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

void Fill(int rep) {
	for (int i = 0; i < rep; i++) Next();
}

const int P = 23;
int N, Q, A[20000009], B[1 << P]; vector<int>vec[1 << P];

int main() {
	cin >> N >> Q >> seed;
	Fill(10000);
	for (int i = 0; i < N; i++) {
		A[i] = Next();
		B[(A[i] >> (31 - P)) + 1]++;
		vec[(A[i] >> (31 - P))].push_back(A[i]);
	}
	for (int i = 1; i < (1 << P); i++) B[i] += B[i - 1];

	long long ret = 0;
	for (int i = 1; i <= Q; i++) {
		int x = Next();
		int sum = B[x >> (31 - P)];
		for (int j = 0; j < vec[x >> (31 - P)].size(); j++) {
			if (vec[x >> (31 - P)][j] < x) sum++;
		}
		ret ^= 1LL * (i - 1) * sum;
	}
	cout << ret << endl;
	return 0;
}