#include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using complex_t = complex<double>;
void fft(vector<complex_t>& a) {
int n = sz(a), L = 31 - __builtin_clz(n);
static vector<complex<long double>> R(2, 1);
static vector<complex_t> rt(2, 1); // (^ 10% faster if double)
for (static int k = 2; k < n; k *= 2) {
R.resize(n); rt.resize(n);
auto x = polar(1.0L, acos(-1.0L) / k);
for (int i = k; i < k + k; i++)
rt[i] = R[i] = i & 1 ? R[i / 2] * x : R[i / 2];
}
vector<int> rev(n);
for (int i = 0; i < n; i++)
rev[i] = (rev[i / 2] | (i & 1) << L) / 2;
for (int i = 0; i < n; i++)
if (i < rev[i]) swap(a[i], a[rev[i]]);
for (int k = 1; k < n; k *= 2) {
for (int i = 0; i < n; i += 2 * k)
for (int j = 0; j < k; j++) {
auto x = (double*)&rt[j + k], y = (double*)&a[i + j + k]; /// exclude-line
complex_t z(x[0] * y[0] - x[1] * y[1], x[0] * y[1] + x[1] * y[0]); /// exclude-line
a[i + j + k] = a[i + j] - z;
a[i + j] += z;
}
}
}
template <typename T>
vector<T> multiply(const vector<T>& a, const vector<T>& b) {
if (a.empty() || b.empty()) return {};
vector<T> res(sz(a) + sz(b) - 1);
int L = 32 - __builtin_clz(sz(res)), n = 1 << L;
vector<complex_t> in(n), out(n);
copy(all(a), begin(in));
for (int i = 0; i < sz(b); i++)
in[i].imag(b[i]);
fft(in);
for (complex_t& x : in)
x *= x;
for (int i = 0; i < n; i++)
out[i] = in[-i & (n - 1)] - conj(in[i]);
fft(out);
for (int i = 0; i < sz(res); i++) {
res[i] = static_cast<T>(imag(out[i]) / (4 * n) + (is_integral_v<T> ? (imag(out[i]) > 0 ? 0.5 : -0.5) : 0));
}
return res;
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> a(n + 1), b(m + 1);
for (int i = 0; i <= n; i++) cin >> a[i];
for (int i = 0; i <= m; i++) cin >> b[i];
auto res = multiply(a, b);
long long ans = 0;
for (auto v : res) ans ^= v;
cout << ans;
return 0;
}
