#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")

// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> inline void chkmin(T& x, T y) { x = min(x, y); }
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 2e6 + 10;
int n, q, b[N], lst, aa[N];
pair <int, int> a[N];
set <pair <int, int>> s;
signed main() {
	read(n), read(q);
	F(i, 1, n) read(aa[i]), a[i].first = aa[i], a[i].second = i;
	F(i, 1, n) read(b[i]), s.emplace(-b[i], i), chkmax(lst, aa[i] + b[i]);
	sort(a + 1, a + n + 1);
	F(i, 1, q) {
		read(b[n + i]);
		b[n + i] ^= lst;
		s.erase(make_pair(-b[i], i));
		s.emplace(b[n + i], n + i);
		lst = 0;
		F(j, 1, min(n, 20)) {
			chkmax(lst, a[j].first + b[a[j].second + i]);
		}
		auto pos = s.begin();
		F(j, 1, min(n, 20)) {
			// debug << pos -> first << " " << pos -> second << endl;
			chkmax(lst, -pos -> first + aa[pos -> second - i]);
			pos++;
		}
		cout << lst << '\n';
	}
	return 0;
}
/* why?
*/