#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>

using namespace std;
using Int = long long;
//INSERT ABOVE HERE
using ull = unsigned long long;
ull seed;
Int next() {
  seed = seed ^ (seed << 13);
  seed = seed ^ (seed >> 7);
  seed = seed ^ (seed << 17);
  return (seed >> 33);
}
constexpr signed N = 2e5;
constexpr signed Q = 5e7;
constexpr signed W = 1e5;
constexpr signed B = 17;
signed a[N];
ull xx[W],yy[W];
ull *x=xx,*y=yy;
constexpr ull ms=(1LL<<B)-1;
constexpr signed SZ = max(1<<B, W);
signed c[SZ];
inline void rsort(Int e){
  memset(c,0,sizeof(c));
  for(signed i=0;i<W;i++) c[(x[i]>>e)&ms]++;
  for(signed i=1;i<SZ;i++) c[i]+=c[i-1];
  for(signed i=W-1;i>=0;i--){
    y[c[(x[i]>>e)&ms]-1]=x[i];
    c[(x[i]>>e)&ms]--;
  }
  swap(x,y);
}
signed main() {
  Int n, q;
  cin >> n >> q >> seed;
  for (signed i = 0; i < 10000; i++) next();
    
  for (signed i = 0; i < N; i++) a[i] = next();
  sort(a,a+N);
  
  Int ans=0;
  for(signed i=0;i<Q;i+=W){
    for(signed j=0;j<W;j++) x[j]=(next()<<B)|j;
    
    rsort(0);rsort(B);rsort(B+B);
  
    for(signed j=0,cnt=0;j<W;j++){
      cnt = lower_bound(a+cnt,a+N,(x[j]>>B))-a;
      ans ^= (i+(x[j]&ms)) * cnt;
    }
  }
  
  cout<<ans<<endl;
}