#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
//#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

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

void solve(){
	int N,Q;
	cin>>N>>Q>>seed;
	vector<int> A(N);//
	
	for(int i=0;i<10000;++i){
		next();
	}
	const int hakoMAX = 2000000;
	vector<int> hako(hakoMAX,0);
    for (int i = 0; i < N; ++i){
		A[i] = next();
		hako[ A[i]>>13 ]++;
	}
	for(int i=1;i<hakoMAX;++i){
		hako[i] += hako[i-1];
	}
	sort(A.begin(),A.end());
	
	//////////////
	LL ans = 0;
	
	for(int i=0;i<Q;++i){
		int x = next();
		int L,R;
		int ter = x>>13;
		if( ter == 0 ){
			L = 0;
			R = hako[ter];
		}else{
			L = hako[ter-1];
			R = hako[ter];
		}
		LL index =lower_bound(A.begin()+L,A.begin()+R,x)-A.begin();
		ans ^= (index*i);
	}
		
	cout << ans << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()