#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;cin >> n >> m;

    vector<long long> a(n), b(m);
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i) cin >> b[i];

    long long res = 0;
    for (int k = 0; k <= 30; ++k) {
        long long mod = 1LL << (k + 1);
        long long t = 1LL << k;

        vector<long long> mb(m);
        for (int j = 0; j < m; ++j) mb[j] = b[j] % mod;
        sort(mb.begin(), mb.end());

        long long cnt = 0;
        for (int i = 0; i < n; ++i) {
            long long x = a[i] % mod;
            
            auto it1 = lower_bound(mb.begin(), mb.end(), t - x);
            auto it2 = lower_bound(mb.begin(), mb.end(), 2 * t - x);
            cnt += distance(it1, it2);

            auto it3 = lower_bound(mb.begin(), mb.end(), 3 * t - x);
            auto it4 = lower_bound(mb.begin(), mb.end(), 4 * t - x);
            cnt += distance(it3, it4);
        }

        if (cnt & 1) res |= t;
    }

    cout << res << endl;
    return 0;
}