#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

using ll = long long;
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 B = 1 << 18;
const int C = 1 << 13;
int help[B+1];


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(a.begin(), a.end());

  // precomp
  rep(i,B) {
    int cnt=lower_bound(a.begin(),a.end(),i*C)-a.begin();
    help[i]=cnt;
  }
  help[B]=n;

  ll sm = 0;
  for (int i = 0; i < q; i++) {
    int x = next();
    int msk=x>>13;
    int lo=help[msk],hi=help[msk+1];
    int cnt = lower_bound(a.begin()+lo,a.begin()+hi,x)-a.begin();
    sm ^= ll(cnt) * i;
  }
  cout << sm << endl;
  return 0;
}