#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull seed;
int next(){
	seed^=seed<<13;
	seed^=seed>>7;
	seed^=seed<<17;
	return seed>>33;
}
int a[200000];
main(){
	int N,Q;
	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);
	ull z=0;
	for(ull i=0;i<Q;++i){
		z^=(lower_bound(a,a+N,next())-a)*i;
	}
	cout<<z;
}