#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;

ull seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}
const int vsize = 1LL << 19;
vector<int> d[vsize + 10];
int sum[vsize + 10];
const int INT_MAX = (1LL << 31) - 1;

int main() {
    int n, q;
    cin >> n >> q >> seed;
    for (int i = 0; i < 10000; i++) next();
    vector<int> a(n), x(q);
    int w = INT_MAX / vsize + !!(INT_MAX % vsize);
    
    for (int i = 0; i < n; i++){
        a[i] = next();
        d[a[i] / w].push_back(a[i]);
    }
    for (int i = 0; i < q; i++) x[i] = next();
    sum[0] = d[0].size();
    for (int i = 1; i < vsize + 10; i++) sum[i] = sum[i - 1] + d[i].size();
    ll ans = 0;
    for (int i = 0; i < q; i++) {
        int now = x[i] / w;
        int cnt = (now != 0 ? sum[now - 1] : 0);
        for (int j = 0; j < d[now].size(); j++){
            if(d[now][j] < x[i]) cnt++;
        }
        ans ^= (ll)cnt * i;
    }
    cout << ans << endl;
    return 0;
}