#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

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

const int MAX = INT_MAX;
const int SIZE = 20000;

int main()
{
    int n, q;
    cin >> n >> q >> seed;

    for(int i=0; i<10000; ++i)
        next();

    vector<int> a(n);
    for(int i=0; i<n; ++i)
        a[i] = next();
    sort(a.begin(), a.end());

    vector<int> cnt(MAX / SIZE + 2, 0);
    vector<vector<int> > v(MAX / SIZE + 1);
    for(int i=0; i<n; ++i){
        ++ cnt[a[i]/SIZE+1];
        v[a[i]/SIZE].push_back(a[i]);
    }
    for(int i=0; i<=MAX/SIZE; ++i)
        cnt[i+1] += cnt[i];

    long long ans = 0;
    for(int i=0; i<q; ++i){
        int x = next();
        int y = cnt[x/SIZE];
        y += lower_bound(v[x/SIZE].begin(), v[x/SIZE].end(), x) - v[x/SIZE].begin();
        ans ^= y * (long long)i;
    }
    cout << ans << endl;

    return 0;
}