#include <iostream>
#include <vector>

using namespace std;

using ll = long long;
using ull = unsigned long long;

const int N = 1 << 22;
vector<int> g[N + 1];

int sum[N + 1];

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();
      g[a[i] >> 9].push_back(a[i]);
    }
    for (int i = 0; i < N; i++) {
      sum[i + 1] = sum[i] + g[i].size();
    }

    ll sm = 0;
    for (int i = 0; i < q; i++) {
        int x = next();
        int cnt = sum[x >> 9];
        for (int y : g[x >> 9]) {
          if (y < x) cnt++;
        }
        sm ^= ll(cnt) * i;
    }
    cout << sm << endl;
    return 0;
}