#include<bits/stdc++.h>
using namespace std;
int n,m;
priority_queue<pair<int,pair<int,int> > >q1,q2,del1,del2;
priority_queue<pair<int,pair<int,int> >,vector<pair<int,pair<int,int> > > ,greater<pair<int,pair<int,int> > > >u1,del;
int a[200005],b[200005];
long long ans[1000005];
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for(int i = 1;i<=n;i++){
		cin >> a[i];
	}for(int i = 1;i<=n;i++)cin >> b[i];
	for(int i = 1;i<=n;i++){
		q1.push({a[i],{i,1}});q2.push({a[i]+b[i],{i,1}});
	}for(int i = 1;i<=3*n;i++){
		//cout << "   " << q2.top().first << " " << q2.top().second.first << " " << q2.top().second.second << endl;
		//if(del.size())cout << "   " << del2.top().first <<" " << del2.top().second.first << " " << del2.top().second.second << endl;
		while(!del1.empty() and q1.top() == del1.top())q1.pop(),del1.pop();
		while(!del2.empty() and q2.top() == del2.top())q2.pop(),del2.pop();
		while(!del.empty() and u1.top() == del.top())u1.pop(),del.pop();
		long long mx = ans[i-1]+q1.top().first,pos =1;
		if(!q2.empty() and !u1.empty()){
			if(ans[i-1]-u1.top().first+q2.top().first>mx)mx = max(ans[i-1]-u1.top().first+q2.top().first,mx),pos = 2;
		}//cout << i << " " << pos << endl;
		if(pos == 1){
			int id = q1.top().second.first,s = q1.top().second.second;
		//	cout << " " << id << " " << s << endl;
			u1.push(q1.top());q1.pop();
			if(s == 3){
				del.push({b[id],{id,2}});
			}if(s == 2){
				del2.push({a[id]+b[id],{id,2}});
			//	cout << a[id]+b[id] << " " << id << " " << 2 << endl;
				del.push({a[id],{id,1}});
				q1.push({a[id],{id,3}});
			}if(s == 1){
				del2.push({a[id]+b[id],{id,1}});q2.push({a[id]+b[id],{id,2}});
				q1.push({b[id],{id,2}});
			}
		}else{
			int id = q2.top().second.first,s = q2.top().second.second;
			int id1 = u1.top().second.first,s1= u1.top().second.second;
		//	cout << "  " << id << " " << s << " " << id1 << " " << s1 << endl;
			q2.pop();u1.pop();
			if(s == 1){
				del1.push({a[id],{id,1}});q1.push({a[id],{id,3}});
				u1.push({b[id],{id,2}});
			}if(s == 2){
				del1.push({b[id],{id,2}});u1.push({a[id],{id,3}});
			}//q2.pop();
	//		cout << "   " << del2.top().first <<" " << del2.top().second.first << " " << del2.top().second.second << endl;
	//		cout << "   " << q2.top().first << " " << q2.top().second.first << " " << q2.top().second.second << endl;
			if(s1 == 1){
				q1.push({a[id1],{id1,1}});del1.push({b[id1],{id1,2}});
				q2.push({a[id1]+b[id1],{id1,1}});del2.push({a[id1]+b[id1],{id1,2}});
			}if(s1 == 2){
				q1.push({b[id1],{id1,2}});del1.push({a[id1],{id1,3}});
				q2.push({a[id1]+b[id1],{id1,2}});
			}if(s1 == 3){
				q1.push({a[id1],{id1,3}});
			}
		}ans[i] = mx;
	}for(int i = 3*n+1;i<=m;i++)ans[i] = ans[3*n];
	long long tot =0 ;
//	for(int i = 1;i<=3*n;i++)cout << ans[i] << " ";cout << endl;
	for(int i = 1;i<=m;i++)tot = tot^ans[i];
	cout << tot << endl;
	return 0;
}