#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
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();
  sort(ALLOF(a));

  vector<pair<int,int>> query;

  ll sm = 0;
  for (int i = 0; i < q; i++) {
    int x = next();
    query.push_back(make_pair(x,i));

    if(query.size() == 10000 || i == q-1){
      sort(ALLOF(query));

      int pos = 0;
      rep(j,query.size()){
        int x = query[j].first;
        int id = query[j].second;
        while(pos < a.size() && a[pos] < x) pos++;
        //cout << x << " " << pos << endl;
        sm ^= (ll)(pos) * id;
      }

      query.clear();
    }
  }

  cout << sm << endl;
  return 0;
}