#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

u64 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<vector<int>> v(1 << 20);
    for (int i = 0; i < n; i++) {
        int x = next();
        v[x >> 11].emplace_back(x);
    }
    vector<int> s(1 << 20);
    for (int i = 0; i+1 < s.size(); ++i) {
        s[i+1] = s[i]+v[i].size();
    }
    ll sm = 0;
    for (int i = 0; i < q; i++) {
        int x = next();
        int cnt = s[x >> 11];
        for (auto &&j : v[x >> 11]) {
            if(j < x) cnt++;
        }
        sm ^= ll(cnt) * i;
    }
    cout << sm << endl;
    return 0;
}