#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int N=1e6+10;
const int M=1e9;
int n,k,q,lst,maxn,a[N],b[N],c[N<<1],d[N<<1],L=1,R=0;
mt19937 rnd(time(0));
signed main()
{
	n=read(),q=read();
	for(int i=1;i<=n;i++)a[i]=read(),maxn=max(maxn,a[i]);
	for(int i=1;i<=n;i++)b[i]=read();
	for(int i=1;i<=n;i++)lst=max(lst,a[i]+b[i]);
	printf("%lld",lst);
	putchar('\n');
	k=max(lst-maxn-N,0ll);
	for(int i=1;i<=n;i++)
		if(b[i]>=k){
			R++;
			c[R]=b[i];
			d[R]=i;
		}
	while(q--){
		int x=read()^lst;
		lst=0;
		for(int i=L;i<=R;i++){
			d[i]--;
			if(d[i])lst=max(lst,c[i]+a[d[i]]);
		}
		if(d[L]==0)L++;
		if(x>=k){
			R++;
			c[R]=x;
			d[R]=n;
			lst=max(lst,x+a[n]);
		}
		k=max(lst-maxn-N,k);
		printf("%lld",lst);
		putchar('\n');
	}
	return 0;
}