#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
#define vv(a,b,c,d) vector<vector<a> >(b,vector<a>(c,d))
#define vvv(a,b,c,d,e) vector<vector<vector<a> > >(b,vv(a,c,d,e))
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

int N, Q;
int A[200000], B[200000];
int X[50000000];
int cnt[200001];

// https://gist.github.com/yosupo06/f8b62b4d070275d9814ecaf45519f720
ull seed;
int next() {
    seed = seed ^ (seed << 13);
    seed = seed ^ (seed >> 7);
    seed = seed ^ (seed << 17);
    return (seed >> 33);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);
    
    cin >> N >> Q >> seed;

    rep(i, 10000)next();

    rep(i, N) {
        A[i] = next();
        B[i] = A[i];
    }
    sort(A, A + N);
    int M = (int)(unique(A, A + N) - A);
    rep(i, N) {
        B[i] = lower_bound(A, A + M, B[i]) - A;
        cnt[B[i]+1]++;
    }
    rep(i, M)cnt[i + 1] += cnt[i];

    rep(i, Q) {
        X[i] = next();
    }
    
    // これはだめ
    // sort(X, X + Q);

    ll ans = 0;
    rep(i, Q) {
        auto k = upper_bound(A, A + M, X[i] - 1) - A;
        ans ^= (ll)i * cnt[k];
    }
    cout << ans << endl;
}