#include <bits/stdc++.h>

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

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();

  ll sm = 0;

  sort(a.begin(), a.end());

  for(int i = 0;i < q;i++){
    int qq = next();
    int tmp = lower_bound(a.begin(), a.end(), qq) - a.begin();
    sm ^= ll(tmp) * i;
  }
  cout << sm << endl;
  return 0;
}