#include <bits/stdc++.h>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back	

typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<double, int> d_i;

int INF = INT_MAX / 10;
double EPS = 1e-6;

using ull = unsigned long long;
ull seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}

const int M = 1<<20, B = 1<<11;

int main() {
	int N, Q; cin >> N >> Q >> seed;
	rep(t, 10000) next();
	vector<int> a(N);
	rep(i, N) a[i] = next();
	vector<vector<int>> v(M);
	rep(i, N) v[a[i] / B].pb(a[i]);
	vector<int> sum(M + 1);
	rep(j, M) sum[j + 1] = sum[j] + v[j].size();
	ll X = 0;
	rep(q, Q) {
		int x = next(), j = x / B;
		int ans = sum[j];
		for (int y: v[j]) if (y < x) ans++;
		X ^= (ll)q * ans;
	}
	cout << X << endl;
}