#include <bits/stdc++.h>

using namespace std;

const int N = 2e6 + 5, M = 2007;
const int MAX = 1e9;
int n, q, a[N], b[N], pa[M], pb[M], len;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> q;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	for (int i = 1; i <= n; ++i) cin >> b[i];
	int m = min(1500, n);
	int mn = MAX - 1LL * MAX * m / n;
	int l = 1, r = 0;
	for (int i = 1; i <= n; ++i) {
		if (a[i] >= mn) pa[++len] = i;
		if (b[i] >= mn) pb[++r] = i;
	}
	int last = 0;
	for (int i = 1; i <= n; ++i) last = max(last, a[i] + b[i]);
	cout << last << '\n';
	for (int d = 1; d <= q; ++d) {
		cin >> b[n + d];
		b[n + d] ^= last;
		if (b[n + d] >= mn) pb[++r] = n + d;
		if (pb[l] <= d) ++l;
		last = 0;
//		for (int i = 1; i <= len; ++i)
//			last = max(last, a[pa[i]] + b[pa[i] + d]);
//		for (int i = l; i <= r; ++i)
//			last = max(last, a[pb[i] - d] + b[pb[i]]);
		int ans0 = 0, ans1 = 0, ans2 = 0, ans3 = 0, ans4 = 0, ans5 = 0, ans6 = 0, ans7 = 0;
		int i = 1;
		for (i = 1; i + 7 <= len; i += 8) {
			ans0 = max(ans0, a[pa[i]] + b[pa[i] + d]);
			ans1 = max(ans1, a[pa[i + 1]] + b[pa[i + 1] + d]);
			ans2 = max(ans2, a[pa[i + 2]] + b[pa[i + 2] + d]);
			ans3 = max(ans3, a[pa[i + 3]] + b[pa[i + 3] + d]);
			ans4 = max(ans4, a[pa[i + 4]] + b[pa[i + 4] + d]);
			ans5 = max(ans5, a[pa[i + 5]] + b[pa[i + 5] + d]);
			ans6 = max(ans6, a[pa[i + 6]] + b[pa[i + 6] + d]);
			ans7 = max(ans7, a[pa[i + 7]] + b[pa[i + 7] + d]);
		}
		for (; i <= len; ++i) last = max(last, a[pa[i]] + b[pa[i] + d]);
		i = l;
		for (int i = l; i + 7 <= r; i += 8) {
			ans0 = max(ans0, a[pb[i] - d] + b[pb[i]]);
			ans1 = max(ans1, a[pb[i + 1] - d] + b[pb[i + 1]]);
			ans2 = max(ans2, a[pb[i + 2] - d] + b[pb[i + 2]]);
			ans3 = max(ans3, a[pb[i + 3] - d] + b[pb[i + 3]]);
			ans4 = max(ans4, a[pb[i + 4] - d] + b[pb[i + 4]]);
			ans5 = max(ans5, a[pb[i + 5] - d] + b[pb[i + 5]]);
			ans6 = max(ans6, a[pb[i + 6] - d] + b[pb[i + 6]]);
			ans7 = max(ans7, a[pb[i + 7] - d] + b[pb[i + 7]]);
		}
		for (; i <= r; ++i) last = max(last, a[pb[i] - d] + b[pb[i]]);
		last = max({last, ans0, ans1, ans2, ans3, ans4, ans5, ans6, ans7});
		cout << last << '\n';
	}
	return 0;
}