#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int maxn = 1e6 + 5;
int n, q, W = 1000000000, b[maxn], ans[maxn], lasans;
struct ASK {
	int w, id;
}Q[maxn];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> q;
	for(int i = 1;i <= n;i++) cin >> Q[i].w, Q[i].id = i;
	sort(Q + 1, Q + 1 + n, [](ASK a, ASK b) {return a.w > b.w;});
	int T = W / sqrt(n);
	for(int i = 1, x;i <= n + q;i++) {
		cin >> b[i];
		b[i] ^= lasans;
		for(int j = 1;j <= n;j++) {
			if(Q[j].w + b[i] <  W - T) break;
			int id = i - Q[j].id + 1;
			if(id >= 1 && id <= q) ans[id] = max(ans[id], Q[j].w + b[i]);
		}
		if(i < n) continue;
//		cout << ans[i - n + 1] << " " << W - 2 * T << endl;
		if(ans[i - n + 1] <  W - T) {
			for(int j = 1;j <= n;j++) ans[i - n + 1] = max(ans[i - n + 1], Q[j].w + b[i - n + Q[j].id]);
		}
		lasans = ans[i - n + 1];
		cout << ans[i - n + 1] << '\n';
	}
}