#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],b[200000];
main(){
	int N,Q,d;
	cin>>N>>Q>>seed;
	d=(1u<<31)/N+1;
	for(int i=0;i<10000;++i){
		next();
	}
	for(int i=0;i<N;++i){
		++b[(a[i]=next())/d+1];
	}
	for(int i=0;i<N-1;++i){
		b[i+1]+=b[i];
	}
	sort(a,a+N);
	ull z=0;
	for(ull i=0;i<Q;++i){
		int x=next();
		z^=(lower_bound(a+b[x/d],a+b[x/d+1],x)-a)*i;
	}
	cout<<z;
}