#include "bits/stdc++.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif


const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; 

void solve() {
    int N, Q; cin >> N >> Q;
    int NN = max(N, 10);
    ld prob = 1 - pow(1/((ld)NN), 1/((ld)(NN-1)));
    ld lo = 1, hi = 2;
    F0R(iter, 300) {
        ld mid = (lo+hi)/2;
        ld val = (2-mid)/2 - (2-mid)*(2-mid)/4;
        if (val < prob) {
            hi = mid;
        } else lo = mid;
    }
    int cap = 1e9 * lo;
    int ans[Q+1]; F0R(i, Q+1) ans[i] = 0;
    vi A(N);
    vi B(N);
    vpi As;
    F0R(i, N) {
        cin >> A[i];
        As.pb({A[i], i});
    }
    sort(all(As)); reverse(all(As));
    F0R(i, N) cin >> B[i];
    F0R(i, N) {
        F0R(j, N) {
            if (B[i] + As[j].f < cap) break;
            if (As[j].s > i) continue;
            if (Q <= i-As[j].s) {
                ckmax(ans[i-As[j].s], As[j].f+B[i]);
            }
        }
    }

    F0R(q, Q+1) {
        if (ans[q] == 0) {
            F0R(i, N) {
                ckmax(ans[q], A[i] + B[i+q]);
            }
        }
        cout << ans[q] << nl;
        if (q == Q) break;
        int V; cin >> V; V ^= ans[q];
        B.pb(V);
        F0R(j, N) {
            if (V + As[j].f < cap) break;
            if (Q <= q+N-As[j].s) {
                ckmax(ans[q+N-As[j].s], As[j].f+V);
            }
        }
    }

}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int T = 1;
//    cin >> T;
    while(T--) {
        solve();
    }

	return 0;
}