#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int &i : a) cin >> i;
    vector<int> ops;
    for (int i = 1; i <= q; ++i) {
        int x;
        cin >> x;
        if (ops.size() > 0 && ops.back() == -x) {
            ops.pop_back();
        }
        else {
            ops.push_back(x);
        }
    }
    if (ops.size() == 0) {
        for (int i : a) cout << i << ' ';
        cout << '\n';
        return;
    }
    vector<int> ans(n, 0);
    if (ops.front() == 2) {
        reverse(all(a));
    }
    for (int b = 0; b < 30; ++b) {
        vector<int> v(n);
        for (int i = 0; i < n; ++i) {
            v[i] = (a[i] >> b) & 1;
        }
        q = ops.size() / 2;
        v.resize(n + q);
        q = ops.size() / 2;
        int all = 0;
        for (int i = 0; i < n; ++i) {
            all ^= v[i];
        }
        for (int i = 0; i < q; ++i) {
            if (all == 0) {
                v[i + n] = 0;
            }
            if (all == 1) {
                v[i + n] = 1;
            }
            all ^= v[i] ^ v[i + n];
        }
        for (int i = q; i < n + q; ++i) {
            ans[i - q] ^= (1<<b) * v[i];
        }
    }
    if (ops.back() > 0) {
        for (int i = 1; i < n; ++i)
            ans[i] ^= ans[i - 1];
    }
    if (ops.front() == 2) {
        reverse(all(ans));
    }
    for (int i : ans) cout << i << ' ';
    cout << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int T;
    cin >> T;
    while (T--) solve();
}