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

int n,q,s,a[2d5],b[1<<22],*p,x,j;
ll r;
{
	rd(n,q,s);seed=s;
	rep(1d4)next();
	a[0..n-1]=next();
	sort(a,a+n);

	rep(i,n){
		while(a[i]>>10>=j+1){
			b[++j]=i;
		}
	}
	b[j+1..(1<<22)-1]=n;

	rep(i,q){
		x=next();
		r^=i*(ll)(lower_bound(a+b[x>>10],a+b[(x>>10)+1],x)-a);
	}
	wt(r);
}