#include <bits/stdc++.h>

using namespace std;

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

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(500, n);
	for (int i = 1; i <= n; ++i) {
		pa[m + 1] = pb[m + 1] = i;
		for (int j = m; j >= 1; --j)
			if (a[pa[j + 1]] > a[pa[j]])
				swap(pa[j + 1], pa[j]);
		for (int j = m; j >= 1; --j)
			if (b[pb[j + 1]] > b[pb[j]])
				swap(pb[j + 1], pb[j]);
	}
	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;
		int cur = 0;
		for (int i = 1; i <= m; ++i)
			if (pb[i] > d)
				pb[++cur] = pb[i];
		pb[m + 1] = n + d;
		for (int i = m; i >= 1; --i)
			if (b[pb[i + 1]] > b[pb[i]])
				swap(pb[i + 1], pb[i]);
		last = 0;
		for (int i = 1; i <= m; ++i)
			last = max(last, a[pa[i]] + b[pa[i] + d]);
		for (int i = 1; i <= m; ++i)
			if (pb[i] > d)
				last = max(last, a[pb[i] - d] + b[pb[i]]);
		cout << last << '\n';
	}
	return 0;
}