#include <bits/stdc++.h>

using namespace std;

const int N = 2e6 + 5;
const int MAX = 1e9;
int n, q, a[N], b[N], p[N], s[N], len;
int ans[N];

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];
	if (n <= 1000 && q <= 1000) {
		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;
			last = 0;
			for (int j = 1; j <= n; ++j) last = max(last, a[j] + b[j + d]);
			cout << last << '\n';
		}
		return 0;
	}
	int m = 8000;
	int mn = MAX - 1LL * MAX * m / n;
	for (int i = 1; i <= n; ++i) {
		if (a[i] >= mn) p[++len] = i, s[len] = a[i];
	}
	int last = 0;
	for (int i = 1; i <= n; ++i) last = max(last, a[i] + b[i]);
	cout << last << '\n';
	for (int i = 1; i <= n; ++i) {
		if (b[i] < mn) continue;
		for (int j = 1; j <= len; ++j)
			if (i > p[j])
				ans[i - p[j]] = max(ans[i - p[j]], b[i] + s[j]);
	}
	int cnt = 0;
	for (int d = 1; d <= q; ++d) {
		cin >> b[n + d];
		b[n + d] ^= last;
		if (b[n + d] >= mn) {
			++cnt;
			for (int j = 1; j <= len; ++j)
				if (n + d > p[j])
					ans[n + d - p[j]] = max(ans[n + d - p[j]], b[n + d] + s[j]);
		}
		last = ans[d];
		cout << last << '\n';
	}
	cerr << cnt << endl;
	return 0;
}