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

ll n,q,s,a[2d5],r,*b;
{
	rd(n,q,s);seed=s;
	rep(1d4)next();
	a[0..n-1]=next();
	sort(a,a+n);
	rep(i,q){
		b=lower_bound(a,a+n,next());
		r^=i*(b?b-a:n);
	}
	wt(r);
}