#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAXN 200010
#define N 0x7fffffff/MAXN+2

int compareInt(const void* a, const void* b);
int next();

unsigned long long seed;
int a[MAXN];
int b[N];
int place[N];

int main() {
  int n, q;
  scanf("%d%d%llu", &n, &q, &seed);
  for(int i = 0; i < 10000; i++) next();

  for(int i = 0; i < n; i++) a[i] = next();
  qsort(a, n, sizeof(int), compareInt);
  memset(place, -1, sizeof(place));
  for(int i = 0; i < n; i++) {
    int now = a[i]/MAXN;
    b[now+1]++;
    if(place[now] == -1) place[now] = i;
  }
  for(int i = 1; i < N; i++) {
    b[i] += b[i-1];
  }
  for(int i = N-2; i >= 0; i--) {
    if(place[i] == -1) place[i] = place[i+1];
  }

  long long ans = 0;
  for(int i = 0; i < q; i++) {
    int x = next();
    int now = x/MAXN;
    long long ima = b[now];
    for(int j = place[now]; j < n; j++) {
      if(a[j] >= x) break;
      ima++;
    }
    ans ^= ima*i;
  }
  printf("%lld\n", ans);
  return 0;
}


int compareInt(const void* a, const void* b) {
  int aNum = *(int*)a;
  int bNum = *(int*)b;
  if( aNum < bNum ){
    return -1;
  }
  else if( aNum > bNum ){
    return 1;
  }
  return 0;
}

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