#include <iostream>
#include <algorithm>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using UL = unsigned int;
#define rep(i,n) for(UL i=0; i<(n); i++)


ULL seed;
UL getRandom670() {
	seed ^= (seed << 13);
	seed ^= (seed >> 7);
	seed ^= (seed << 17);
	return (seed >> 33);
}

UL N, Q;
UL A[200001];
UL C[(1 << 20) + 1] = {};

UL query(UL x) {
	UL p = C[x >> 11];
	while (A[p] < x) p++;
	return p;
}

int main() {
	scanf("%u%u%llu", &N, &Q, &seed);
	rep(i, 10000) getRandom670();
	rep(i, N) A[i] = getRandom670();
	A[N] = ~0u;
	sort(A, A + N);
	rep(i, N) C[(A[i] >> 11) + 1]++;
	rep(i, 1 << 20) C[i + 1] += C[i];

	ULL ans = 0;

	rep(i, Q) ans ^= ULL(query(getRandom670())) * i;
	printf("%llu\n", ans);

	return 0;
}