#include <bits/stdc++.h>
using namespace std;

int mod;

bool cmp(int a, int b)
{
	return (a % mod) < (b % mod);
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(n), b(m);
	vector<bool>cnt_a(31), cnt_b(31);
	for(int &i : a)
	{
		cin >> i;
		for(int j = 0; j <= 30; j++) if((i >> j) & 1) cnt_a[j] = !cnt_a[j];
	}
	for(int &i : b)
	{
		cin >> i;
		for(int j = 0; j <= 30; j++) if((i >> j) & 1) cnt_b[j] = !cnt_b[j];
	}
	int ans = (cnt_a[0] * m + cnt_b[0] * n) % 2;
	for(int i = 1; i <= 30; i++)
	{
		mod = (1 << i);
		sort(a.begin(), a.end(), cmp);
		bool cnt = 0;
		for(int j : b)
		{
			int x = mod - (j % mod);
			int l = -1, r = n;
			while(l < r-1)
			{
				int mid = (l+r) / 2;
				if(a[mid] % mod < x) l = mid;
				else r = mid;
			}
			cnt = cnt ^ ((n-r) % 2);
		}
		ans += ((cnt_a[i] * m + cnt_b[i] * n + cnt) % 2) << i;
	}
	cout << ans;
}