#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 + 1);
    for (int i = 0; i < n; i++) {
        a[i] = next();
    }
    sort(a.begin(), a.begin() + n);
    a[n] = (1U << 31) - 1;

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

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

    cout << r << endl;

    return 0;
}