#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(234);
const ll inf = 1e18;

struct ask {
    int t, l, r;
};

int n, q;
vector<ll> a;
vector<ask> asks;
vector<ll> rs;

void solve_slow() {
    rs.clear();
    rs.reserve(q + n);
    auto b = a;
    for (auto [t, l, r] : asks) {
        if (t == 1) {
            for (int i = r; i > l; i -= 1) {
                b[i] ^= b[i - 1];
            }
        } else {
            rs.push_back(b[l]);
        }
    }
    for (int i = 0; i < n; i += 1) {
        rs.push_back(b[i]);
    }
}


void solve_d(){
    rs.clear();
    rs.reserve(q + n);
    auto b = a;
    int cnt = 0;
    for (auto [t, l, r] : asks) {
        if (t == 1) {
            cnt += 1;
        } else {
            
        }
    }
    for(int j = 0; (1 << j) <= cnt; j += 1){
        if((cnt >> j) & 1){
            for(int i = n - 1; i >= (1 << j); i -= 1){
                b[i] ^= b[i - (1 << j)];
            }
        }
    }
    for (int i = 0; i < n; i += 1) {
        rs.push_back(b[i]);
    }
}


bool is_d(){
    for(auto [t, l, r]: asks){
        if(t == 1){
            if(l != 0 || r != n - 1){
                return false;
            }
        }
    }
    return true;
}


bool is_e(){
    for(auto [t, l, r]: asks){
        if(t == 2){
            return false;
        }
    }
    return true;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int t;
    cin >> t;
    while (t--) {
        cin >> n >> q;
        a.resize(n);
        for (int i = 0; i < n; i += 1) {
            cin >> a[i];
        }
        asks.resize(q);
        for (int i = 0; i < q; i += 1) {
            int t;
            cin >> t;
            if (t == 1) {
                int l, r;
                cin >> l >> r;
                --l;
                --r;
                asks[i] = ask{t, l, r};
            } else {
                int pos;
                cin >> pos;
                --pos;
                asks[i] = ask{t, pos, 0};
            }
        }
        if(is_d() && is_e()){
            solve_d();
        } else{
            solve_slow();
        }
        for (auto x : rs) {
            cout << x << "\n";
        }
    }
    return 0;
}

/*
1
5 4

*/