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

const int N = 1e5 + 50;

int T, q, n, a[N];
bitset<N> ans;

struct node {
    int op, x, y;
}qur[N];

int main() {
#ifdef LOCAL
    clock_t c1 = clock();
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
#endif
    // ===================================================    
    scanf ("%d", &T);
    while (T --) {
        scanf ("%d%d", &n, &q);
        for (int i = 0; i < n; i ++) {
            scanf ("%d", &a[i]);
        }
        ans.reset ();
        for (int i = 1; i <= q; i ++) {
            int op, x, l, r; scanf ("%d", &op);
            if (op == 1) {
                scanf ("%d%d", &l, &r);
                qur[i] = {op, l, r};
            }else {
                scanf ("%d", &x);
                qur[i] = {op, x};
            }
        }
        for (int i = q; i >= 1; i --) {
            int op = qur[i].op;
            if (op == 1) {
                int l = qur[i].x, r = qur[i].y;
                bitset<N> f = (~bitset<N>(0)) << (l - 1);
                bitset<N> g = (~bitset<N>(0)) << r;
                g &= ans, g >>= (r - l + 1);
                ans = g | (f & ans);
            }else {
                int x = qur[i].x;
                ans[x].flip ();
            }
        }
        int res = 0;
        for (int i = 0; i < n; i ++) 
            if (ans[i]) res ^= a[i];
        printf("%d\n", res);
    }
    // ===================================================    
#ifdef LOCAL
    cerr << "Time Used: " << clock() - c1 << "ms" << endl;
#endif
    return 0;
}