#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
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());

    constexpr int K = 20, L = 31 - K, M = 1 << K;
    vector<int> b(M + 1);
    //for (int j = 0; j < M; j++) {
    //    for (int i = b[j];; i++) {
    //        if (i >= n || a[i] >> L > j) {
    //            b[j + 1] = i;
    //            break;
    //        }
    //    }
    //}
    int j = 1;
    for (int i = 0; i < n; i++) {
        int j0 = a[i] >> L;
        while (j <= j0) b[j++] = i;
    }
    while (j <= M) b[j++] = n;

    ll r = 0;
    for (int h = 0; h < q; h++) {
        int x = next();
        int j = x >> L;
        for (int i = b[j];; i++) {
            if (i >= b[j + 1] || a[i] >= x) {
                r ^= (ll)i * h;
                break;
            }
        }
    }

    cout << r << endl;

    return 0;
}