#include <bits/stdc++.h>

using namespace std;


const int MAX_N = 100000 + 5;
int N, M;
int a[MAX_N], b[MAX_N], f[MAX_N];
long long sum, ans;

priority_queue<pair<int,int>> q1, q2, q3;

void push(int i) {
    if (f[i] == 0) {
        q1.push(make_pair(a[i], i));
        q2.push(make_pair(a[i] + b[i], i));
    } else if (f[i] == 1) {
        q1.push(make_pair(b[i], i));
        q2.push(make_pair(b[i] + a[i], i));
        q3.push(make_pair(-a[i], i));
    } else if (f[i] == 2) {
        q1.push(make_pair(a[i], i));
        q3.push(make_pair(-b[i], i));
    } else {
        q3.push(make_pair(-a[i], i));
    }
}

int main() {
	scanf("%d%d", &N, &M);
    for (int i = 1; i <= N; i ++) {
        scanf("%d", &a[i]);
    }
    for (int i = 1; i <= N; i ++) {
        scanf("%d", &b[i]);
        push(i);
    }

    for (int k = 1; k <= M; k ++) {
        if (k <= N * 3) {
            int i, j, t1, t2;
            while (q1.size()) {
                i = q1.top().second, t1 = q1.top().first;
                if (f[i] == 3 || f[i] == 1 && b[i] != t1 || (f[i] != 1 && a[i] != t1)) {
                    q1.pop();
                } else break;
            }
            while (q2.size()) {
                i = q2.top().second, t1 = q2.top().first;
                if (f[i] >= 2 || t1 != a[i] + b[i]) {
                    q2.pop();
                } else break;
            }
            while (q3.size()) {
                i = q3.top().second, t1 = q3.top().first;
                if (f[i] == 0 || f[i] == 2 && -b[i] != t1 || f[i] != 2 && -a[i] != t1) {
                    q3.pop();
                } else break;
            }

            t1 = -1e9, t2 = -1e9;
            if (q1.size()) {
                t1 = q1.top().first;
            }
            if (q2.size() && q3.size()) {
                t2 = q2.top().first + q3.top().first;
            }

            if (t1 >= t2) {
                i = q1.top().second;
                q1.pop();
                sum += t1;
                f[i] ++;
                push(i);
            } else {
                i = q2.top().second;
                j = q3.top().second;
                q2.pop(), q3.pop();
                sum += t2;
                f[i] += 2, f[j] -= 1;
                push(i), push(j);
            }
        }
        ans ^= sum;
    }
    printf("%lld\n", ans);
    return 0;
}