#include<bits/stdc++.h>
using namespace std;
int n,q; 
const int T=1e6;
const int maxn=1e6+5;
vector< pair<int,int> > v1,v2;
int a[maxn],b[maxn<<1];
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin>>n>>q; 
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]>T) v1.push_back(make_pair(i,a[i]));
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
		if(b[i]>T) v2.push_back(make_pair(i,b[i]));
	}
	int lastans=0;
	for(int i=1;i<=n;i++){
		lastans=max(lastans,a[i]+b[i]);
	}
	cout<<lastans<<endl; 
	for(int i=1;i<=q;i++){
		cin>>b[i+n];
		b[i+n]^=lastans;
		for(auto it=v2.begin();it!=v2.end();it++){
			if((*it).first==1){
				it=v2.erase(it);
				continue;
			}
			(*it).first--;
		}
		if(b[i+n]>T) v2.push_back(make_pair(n,b[i+n]));
		bool f=0;
		int ans=0;
		for(int k=0,j=0;k<(int)v1.size();k++){
			while(j<(int)v2.size() && v2[j].first<v1[k].first){
				j++;
			}
			if(j<(int)v2.size() && v2[j].first==v1[k].first){
				ans=max(ans,v2[j].second+v1[k].second);
				f=1;
			}
		}
		if(!f){
			for(int j=1;j<=n;j++){
				ans=max(ans,a[j]+b[i+j]);
			}
		}
		cout<<(lastans=ans)<<endl;
	}
	return 0;
}