#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;
using ull = unsigned long long;

int a[200010];
int n, q;

ull seed;
uint next()
{
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}

int solve(ull x)
{
    if (x == 0)
        return 0;
    uint lo = 0; // lo 個は x より小さい
    ull lo_x = 0;
    uint hi = n + 1; // hi 個目は x 以上
    ull hi_x = 1ULL << 31;
    while (lo + 1 < hi)
    {
        ull s = x - lo_x;
        ull t = hi_x - x;
        int mi = (s * hi + t * lo) / (s + t);
        if (mi == lo)
        {
            mi++;
        }
        if (mi == hi)
        {
            mi--;
        }
        if (a[mi - 1] < x)
        {
            lo = mi;
            lo_x = a[mi - 1];
        }
        else
        {
            hi = mi;
            hi_x = a[mi - 1];
        }
    }
    return lo;
}

int main()
{
    cin >> n >> q >> seed;
    for (int i = 0; i < 10000; i++)
        next();

    for (int i = 0; i < n; i++)
        a[i] = next();

    sort(a, a + n);
    ll sm = 0;
    for (int i = 0; i < q; i++)
    {
        int x = next();
        int cnt = solve(x);
        sm ^= ll(cnt) * i;
    }
    cout << sm << endl;
    return 0;
}