#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;

using uint = unsigned;
pair< uint, uint > v[33][1000000];
int tail[33];

template< typename T >
struct RadixHeap
{
  
  uint size, last;

  RadixHeap() : size(0), last(0) {
  }

  bool empty() const { return size == 0; }

  inline int getbit(uint a)
  {
    return a ? 32 - __builtin_clz(a) : 0;
  }

  void push(uint key, const T &value)
  {
    ++size;
    int x= getbit(key ^ last);
    v[x][tail[x]++] = make_pair(key, value);
  }

  void pop()
  {
    if(tail[0] == 0) {
      int idx = 1;
      while(tail[idx] == 0) ++idx;
      last = UINT_MAX;
      for(int i = 0; i < tail[idx]; i++) {
        last = min(last, v[idx][i].first);
      }
      
      for(int i = 0; i < tail[idx]; i++) {
        int x = getbit(v[idx][i].first ^ last);
        v[x][tail[x]++] = v[idx][i];
      }
      tail[idx] = 0;
      
    }
    --size;
    --tail[0];
  }
};


ull seed;
inline 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(begin(a), end(a));
    a.push_back(INT_MAX);
    
    ll sm = 0;
    RadixHeap< int > rad;
    int last = 0;
    for (int i = 0; i < q; i++) {
      if(i - last >= 1000000) {
        int ptr = 0;
        for(int j = last; j < i; j++) {
          rad.pop();
          while(a[ptr] < v[0][tail[0]].first) ++ptr;
          sm ^= ll(ptr) * v[0][tail[0]].second;
        }
        rad.last = 0;
        last = i;
      }
      rad.push(next(), i);
    }

    int ptr = 0;
    for(int j = last; j < q; j++) {
      rad.pop();
      while(a[ptr] < v[0][tail[0]].first) ++ptr;
      sm ^= ll(ptr) * v[0][tail[0]].second;
    }
    rad.last = 0;

    cout << sm << endl;
}