#include <bits/stdc++.h>
using namespace std;
namespace FastIO {
	struct IO {
	    char ibuf[(1 << 20) + 1], *iS, *iT, obuf[(1 << 20) + 1], *oS;
	    IO() : iS(ibuf), iT(ibuf), oS(obuf) {} ~IO() { fwrite(obuf, 1, oS - obuf, stdout); }
		#if ONLINE_JUDGE
		#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, (1 << 20) + 1, stdin), (iS == iT ? EOF : *iS++) : *iS++)
		#else
		#define gh() getchar()
		#endif
		inline bool eof (const char &ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == 't' || ch == EOF; }
	    inline long long read() {
	        char ch = gh();
	        long long x = 0;
	        bool t = 0;
	        while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
	        while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
	        return t ? ~(x - 1) : x;
	    }
	    inline void read (char *s) {
	    	char ch = gh(); int l = 0;
	    	while (eof(ch)) ch = gh();
	    	while (!eof(ch)) s[l++] = ch, ch = gh();
	    }
	    inline void read (double &x) {
	    	char ch = gh(); bool t = 0;
	    	while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
	    	while (ch >= '0' && ch <= '9') x = x * 10 + (ch ^ 48), ch = gh();
	    	if (ch != '.') return t && (x = -x), void(); ch = gh();
	    	for (double cf = 0.1; '0' <= ch && ch <= '9'; ch = gh(), cf *= 0.1) x += cf * (ch ^ 48);
	    	t && (x = -x);
	    }
	    inline void pc (char ch) {
	    	#ifdef ONLINE_JUDGE
	    	if (oS == obuf + (1 << 20) + 1) fwrite(obuf, 1, oS - obuf, stdout), oS = obuf; 
	    	*oS++ = ch;
	    	#else
	    	putchar(ch);
	    	#endif
		}
		template<typename _Tp>
	    inline void write (_Tp x) {
	    	static char stk[64], *tp = stk;
	    	if (x < 0) x = ~(x - 1), pc('-');
			do *tp++ = x % 10, x /= 10;
			while (x);
			while (tp != stk) pc((*--tp) | 48);
	    }
	    inline void puts(const char *s){
			int len = strlen(s);
			for (int i = 0; i < len; i++)pc(s[i]);
		}
	} io;
	inline long long read () { return io.read(); }
	template<typename Tp>
	inline void read (Tp &x) { io.read(x); }
	template<typename _Tp>
	inline void write (_Tp x) { io.write(x); }
}
using namespace FastIO;
const int maxn=2e6+10,W=1e9;
int n,m;
int s[maxn],t[maxn],ans[maxn];
vector< pair<int,int> > pa[maxn];
vector<int> p1;
int main()
{
    n=read(),m=read();
    for(int i=1;i<=n;i++)s[i]=read();
    for(int i=1;i<=n;i++)t[i]=read();
    int T=ceil(W/sqrt(n));
    for(int i=1;i<=n;i++)if(s[i]>W-T)p1.push_back(i);
	for(int i=1;i<=n;i++)
		if(t[i]>W-T)
			for(int pos1:p1)
			{
				int st=i-pos1+1;
				if(st>=1&&st<=m+1)pa[st].push_back({pos1,i});
			}
    int lst=0;
    for(int i=1;i<=m+1;i++)
    {
        if(i>1)
        {
            t[i+n-1]=read()^lst;
            if(t[i+n-1]>W-T)
                for(int pos1:p1)
                {
                    int st=i+n-pos1;
                    if(st>=i&&st<=m+1)pa[st].push_back({pos1,i-n+1});
                }
        }
        if(pa[i].size())
            for(auto [c1,c2]:pa[i])ans[i]=max(ans[i],s[c1]+t[c2]);
        else{
            for(int j=1;j<=n;j++)ans[i]=max(ans[i],s[j]+t[i+j-1]);
        }
        printf("%d\n",lst=ans[i]);
    }
}