/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl '\n'
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 3e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;

int a[N],c[N],b[N];

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);


    int n=rd,m=rd;
    for(int i=1;i<=n;i++){
        a[i]=rd;
    }
    for(int j=1;j<=n;j++){
        b[j]=rd;
        c[j]=a[j]+b[j];
    }



    sort(a+1,a+n+1,greater<int> ());
    sort(c+1,c+n+1,greater<int> ());

    int la=0,lc=0;
    int ans=0,sum=0;
    for(int i=1;i<=m;i++){
        if(la<n||lc<n){
            if(la==n){
                sum+=c[++lc];
                sum-=a[la--];
            }else if(lc==n){
                sum+=a[++la];
            }else if(la>0&&a[la+1]+a[la]<c[lc+1]){
                sum+=c[++lc]-a[la--];
            }else{
                sum+=a[++la];
            }
        }
        // cdbg(sum,la,lc);
        ans^=sum;
    }




    cout<<ans<<endl;
    


}