#include <bits/stdc++.h>
#define int long long

using ll = long long;
using namespace std;

const int MAXN = 100010;

int a[MAXN], b[MAXN], p[MAXN], q[MAXN];

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= m; i++) cin >> b[i];
    int ans = 0;
    for (int k = 0; k < 31; k++) {
        int x = 1LL<<k, y = 1LL<<(k+1);
        for (int j = 1; j <= n; j++) {
            p[j] = a[j] % y;
        }
        for (int j = 1; j <= m; j++) {
            q[j] = b[j] % y;
        }
        sort(q+1, q+m+1);
        ll cnt = 0;
        for (int j = 1; j <= n; j++) {
            {
                int left = lower_bound(q+1, q+m+1, x-p[j])-q;
                int right = lower_bound(q+1, q+m+1, y-p[j])-q;
                cnt += right-left;
            }
            {
                int left = lower_bound(q+1, q+m+1, (x+y)-p[j])-q;
                cnt += m-left+1;
            }
        }
        if (cnt&1)
            ans |= 1 << k;
    }
    cout << ans << "\n";
    return 0;
}