#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef unsigned long long ull;

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

int main()
{
	int n, q;
	cin>>n>>q>>seed;
	for (int i = 0; i < 10000; i++) next();
	vector<int> v[1<<18];
    for (int i = 0; i < n; i++){
		int a = next();
		v[a/(1<<13)].push_back(a);
	}
	int s[1<<18];
	s[0]=v[0].size();
	for(int i=1; i<(1<<18); i++){
		s[i]=s[i-1]+v[i].size();
	}
	ll sm=0;
	for(ll i=0; i<q; i++){
		int x=next();
		ll ans=s[x/(1<<13)];
		for(int j=0; j<v[x/(1<<13)].size(); j++){
			if(v[x/(1<<13)][j]>=x) ans--;
		}
		sm^=(ans*i);
	}
	cout<<sm<<endl;
	return 0;
}