#include <algorithm>
#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);
}

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());

    ll len = 21500001;
    vector<vector<ll>> block(len, vector<ll>(0));
    for (ll i = 0; i < n; i++) {
        block[a[i] / 100].push_back(a[i]);
    }
    vector<ll> cumsum(len, 0);
    cumsum[0] = 0;
    for (ll i = 0; i < len - 1; i++) {
        cumsum[i + 1] = cumsum[i] + (block[i].size());
    }

    ll sm = 0;
    for (int i = 0; i < q; i++) {
        int x = next();
        // cout << x << endl;

        // 答えを求めるパート
        ll ans = cumsum[x / 100];
        for (ll j = 0; j < block[x / 100].size(); j++) {
            if (block[x / 100][j] < x) {
                ans++;
            } else {
                break;
            }
        }
        sm ^= (ans * i);
    }
    cout << sm << endl;
    return 0;
}