#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
using ull = unsigned long long;

ull seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}
void Main()
{
	int N,Q;
	cin >> N >> Q >> seed;
	for(int i = 0;i < (int)1e4;i++)
	{
		next();
	}
	const int D = 15;
	vector<vector<int>> B(1 << (31 - D));
	for(int i = 0;i < N;i++)
	{
		int a = next();
		B[a >> D].push_back(a);
	}
	vector<int> S((1 << (31 - D)) + 1);
	for(int i = 0;i < (int)B.size();i++)
	{
		S[i + 1] = S[i] + B[i].size();
	}
	long long ans = 0;
	for(int i = 0;i < Q;i++)
	{
		int x = next();
		int cnt = S[x >> D];
		for(const int &v : B[x >> D])
		{
			if(v < x)
			{
				cnt++;
			}
		}
		ans ^= (long long) cnt * i;
	}
	cout << ans << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}