#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const long long INF = LLONG_MAX / 10;
#else
const int INF = 1010101010;
#endif
using namespace std;
// typedef long long ll;
using ll = long long;
typedef vector<vector<ll> > mat;
typedef pair<int, int> P;
//typedef pair<double, double> P;
const int dx[9] = {-1, 0, 0, 1, -1, -1, 1, 1, 0};
const int dy[9] = {0, -1, 1, 0, -1, 1, -1, 1, 0};
 
using ull = unsigned long long;

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

// int qa[];

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

  // set<int> se;
  // int num[1000];
  // REP(i,n) {
  //   if (i != 0) {
  //     printf("a[%lld] = %lld (%lld)\n", i, a[i], a[i] - a[i - 1]);
  //   }
  //   se.insert(a[i]);
  //   num[a[i] / 10000000]++;
  // }
  // printf("size = %lld\n", se.size());
  // REP(i,100) {
  //   printf("num[%lld] = %lld\n", i, num[i]);
  // }

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

  ll sm = 0;
  map<int, int> ma;
  vector<pair<int, int>> qa(q);
  for (int i = 0; i < q; i++) {
      // int x = next();
      qa[i].first = next();
      qa[i].second = i;
      // ma[]
      // int cnt = 0;
      // for (int j = 0; j < n; j++) {
      //     if (a[j] < x) cnt++;
      // }
      // int cnt = lower_bound(a.begin(), a.end(), x) - a.begin();
      // sm ^= ll(cnt) * i;
  }
  sort(qa.begin(), qa.end());

  map<int, pair<int, int>> ans;
  int ai = 0, qi = 0;
  int cnt = 0;
  // while (a[ai] < qa[qi]) {
  while (true) {
    if (qa.size() <= qi) {
      break;
    }
    if (a[ai] < qa[qi].first) {
      cnt++;
      ai++;
    } else if (a[ai] == qa[qi].first) {
      ans[qa[qi].first] = make_pair(cnt, qa[qi].second);
      cnt++;
      qi++;
      ai++;
    } else if (a[ai] > qa[qi].first) {
      qi++;
    }
  }

  for (int i = 0; i < q; i++) {
      // int x = next();
      //qa[i] = next();

      // int cnt = 0;
      // for (int j = 0; j < n; j++) {
      //     if (a[j] < x) cnt++;
      // }
      // int cnt = lower_bound(a.begin(), a.end(), x) - a.begin();
      int cnt = ans[qa[i].first].first;
      // sm ^= ll(cnt) * i;
      sm ^= ll(cnt) * qa[i].second;
  }

  cout << sm << endl;
}