#include <cstdio>
#include <algorithm>
#define STEP 600
using namespace std;

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

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

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

    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); A[n+1] = (1LL<<31) - 1;

    for(i=0;i<q;i++)
    {
        x = next();
        y = 1LL*x*n/A[n];
        if(y > n) y = n;

        for(z=STEP;!(A[y]<x && A[y+1]>=x);z=(z+1)>>1)
        {
            if(y > 0 && A[y] >= x)
            {
                y -= z;
                if(y < 0) y = 0;
            }
            else if(y < n && A[y+1] < x)
            {
                y += z;
                if(y > n) y = n;
            }
        }

        ans ^= 1LL*i*y;
    }
    printf("%lld",ans);
    return 0;
}