#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int N; int Q; unsigned long long seed;
	while (~scanf("%d%d%llu", &N, &Q, &seed)) {
		auto next = [&seed]() {
			seed = seed ^ (seed << 13);
			seed = seed ^ (seed >> 7);
			seed = seed ^ (seed << 17);
			return (uint32_t)(seed >> 33);
		};
		rep(i, 10000) next();
		vector<uint32_t> A(N + 1);
		rep(i, N) A[i] = next();
		A[N] = 0xffffffffu;
		sort(A.begin(), A.end());
		const int shift = 11, M = 1 << (31 - shift);
		vector<int> index(M + 1);
		rep(i, N) ++ index[(A[i] >> shift) + 1];
		rep(i, M) index[i + 1] += index[i];
		ll anssum = 0;
		rep(qi, Q) {
			auto x = next();
			int i = index[x >> shift];
			for (; A[i] < x; ++ i);
			anssum ^= (ll)i * qi;
		}
		printf("%lld\n", anssum);
	}
	return 0;
}