#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
ull seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}
const int N=2e5+1;
const int M=2200001;
int n,q,a[N],sum[M],res=0;
vector<int>T[M];
signed main() {
    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);
    for (int i = 0; i < n; i++) T[a[i] / 1000].push_back(a[i]);
    for(int i=0;i<M-1;i++)sum[i+1]=sum[i]+int(T[i].size());
    for (int i=0;i<q;i++) {
        int x = next();
        int num= sum[x / 1000];
        for(auto X:T[x/1000]) {
        	if(X>=x)break;
        	num++;
        }
        res^= (num* i);
    }
    cout<<res;
}