#include <cstdio>
#include <algorithm>
#define SHIFT 7
using namespace std;

int n,m,q,A[200010];
unsigned long long seed;
long long ans;

int cnt[(1<<(31-SHIFT))+10];

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

int main()
{
    int i,x,y;

    scanf("%d%d%llu",&n,&q,&seed);
    for(i=0;i<10000;i++) next();
    for(i=1;i<=n;i++) A[i] = next();
    sort(A+1,A+n+1);

    m = 1<<(31-SHIFT);
    for(i=1;i<=n;i++) cnt[(A[i]>>SHIFT)+1]++;
    for(i=1;i<=m;i++) cnt[i] += cnt[i-1];

    for(i=0;i<q;i++)
    {
        x = next();
        y = cnt[x>>SHIFT];
        for(;y+1<=n && A[y+1]<x;y++);
        ans ^= 1LL*i*y;
    }
    printf("%lld",ans);
    return 0;
}