#include<bits/stdc++.h>
using namespace std;
struct node{
	int id,num,step;
	bool operator < (const node& rhs) const {
		return num<rhs.num;
	}
};
priority_queue<node>pq;
const int N=1e5+5;
int n,m,a[N],b[N];
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=m;i++)
		scanf("%d",&b[i]);
	for(int i=1;i<=n;i++){
		node now;
		now.id=i;
		now.num=a[i];
		now.step=1;
		pq.push(now);
	}
	long long ans=0,sum=0;
	while(m--){
		node now;
		now=pq.top();
		sum+=now.num;
		pq.pop();
		if(ans==0)ans=sum;
		else ans^=sum;
		if(now.step==3)continue;
		else {
			node p;
			if(now.step==2){
				p.num=a[now.id];
				p.id=now.id;
				p.step=now.step+1;
			} 
			else if(now.step==1){
				p.num=b[now.id];
				p.id=now.id;
				p.step=now.step+1;
			} 
			pq.push(p);
		}
	}
	cout<<ans;
}