#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;
const int N = 1e5+10;
LL a[N],b[N],len=0;
int main(){
	LL n,m;
	LL res=0;
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		res^=a[i];
	}
	int flag=0;
	for(int i=n+1;i<=3*n;i++){
		a[i]=res;
		b[++len]=res;
		res^=a[i-n];
		res^=a[i];
	}
	if(m<=n){
		printf("%d\n",a[m]);
		return 0;
	}
	m-=n;
	b[0]=b[n];
	cout<<b[m%(n+1)];
	return 0;
}