#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second

#define DUMP(x) cout<<#x<<":"<<(x)<<endl
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class T>
istream& operator>>(istream& is, vector<T>& xs){
  for(auto& x: xs)
	is >> x;
  return is;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& xs){
  for(unsigned int i=0;i<xs.size();++i)
	os << (i?" ":"") << xs[i];
  return os;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

#include <iostream>
#include <vector>

using namespace std;
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);
}

void sort1(VI& xs, int n){
  LL p = 1;
  REP(d,4){
	VI bkt[1000];
	REP(i,n)
	  bkt[xs[i]/p%1000].PB(xs[i]);

	int it = 0;
	REP(dd,1000)
	  for(auto x: bkt[dd])
		xs[it++] = x;
	p *= 1000;
  }
}

void sort2(vector<PII>& xs, int n){
  LL p = 1;
  REP(d,4){
	vector<PII> bkt[1000];
	REP(i,n)
	  bkt[xs[i].FF/p%100].PB(xs[i]);

	int it = 0;
	REP(dd,1000)
	  for(auto x: bkt[dd])
		xs[it++] = x;
	p *= 1000;
  }
}

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();
	sort1(a, n);

	vector<PII> qs(q);
	REP(i,q){
	  qs[i] = MP(next(), i);
	}
	sort2(qs, q);
	
    ll sm = 0;
	int cnt = 0;
    for (int i = 0; i < q; i++) {
	  while(cnt < n && a[cnt] < qs[i].FF) ++cnt;
	  sm ^= (ll)(cnt) * qs[i].SS;
    }
    cout << sm << endl;
    return 0;
}