#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr int inf = 0x3f3f3f3f;
constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

constexpr int N = 100010;

void A_SOUL_AvA () {
    int n, q;
    cin >> n >> q;

    vector <int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    bitset <N> f;    

    int ans = 0;
    vector <array<int, 3>> query(q);
    for (int i = 0; i < q; i++) {
        int op;
        cin >> op;
        if (op == 1) {
            int l, r;
            cin >> l >> r;
            query[i] = {op, l, r};
        } else {
            int x;
            cin >> x;
            query[i] = {op, x, 0};
        }
    }

    reverse(all(query));
    for (auto &[op, l, r] : query) {
        if (op == 1) {
            auto low = ~bitset<N>(0) >> (N - (r + 1)) & f;
            auto high = f ^ low;
            f = low ^ high >> (r - l + 1);
        } else {
            f[l] = !f[l];
        }
    }

    for (int i = 1; i <= n; i++) {
        if (f[i]) {
            ans ^= a[i];
        }
    }

    cout << ans << endl;
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}