#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

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

const int N = 1e5 + 9, M = 2002;

int a[N];
bitset<M> zero;
struct ST {
    bitset<M> t[4 * N];
    ST() {}
    void build(int n, int b, int e) {
    	t[n].reset();
        if(b == e) {
            t[n][a[b]] = 1;
            return;
        }
        int mid = (b + e) >> 1,  l = n << 1,  r = l | 1;
        build(l, b, mid);
        build(r, mid + 1, e);
        t[n] = t[l] ^ t[r];
    }
    void upd(int n, int b, int e, int i, int x) {
        if(b > i || e < i) return;
        if(b == e && b == i) {
            t[n][x].flip();
            return;
        }
        int mid = (b + e) >> 1,  l = n << 1,  r = l | 1;
        upd(l, b, mid, i, x);
        upd(r, mid + 1, e, i, x);
        t[n] = t[l] ^ t[r];
    }
    bitset<M> query(int n, int b, int e, int i, int j) {
        if(b > j || e < i) return zero;
        if(b >= i && e <= j) return t[n];
        int mid = (b + e) >> 1,  l = n << 1,  r = l | 1;
        return query(l, b, mid, i, j) ^ query(r, mid + 1, e, i, j);
    }
} t;
int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	zero.reset();
	int tc; cin >> tc;
	while (tc--) {
		int n; cin >> n;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
		}
		t.build(1, 1, n);
		int q; cin >> q;
		while (q--) {
			int ty, l, r; cin >> ty >> l >> r;
			l++, r++;
			if (ty == 0) {
				t.upd(1, 1, n, l, a[l]);
				t.upd(1, 1, n, l, a[r]);
				t.upd(1, 1, n, r, a[r]);
				t.upd(1, 1, n, r, a[l]);
				swap(a[l], a[r]);
			}
			else {
				bitset<M> ans;
				if (l <= r) ans = t.query(1, 1, n, l, r);
				else ans = t.query(1, 1, n, l, n) ^ t.query(1, 1, n, 1, r);
				cout << ans.count() << '\n';
			}
		}
	}
    return 0;
}

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

const int N = 11;

struct Trie {
    struct node {
        node* nxt[2]; int sz;
        node() {
            nxt[0] = nxt[1] = NULL;
            sz = 0;
        }
    }*root;
    Trie() {root = new node(); }
    void insert(int x) {
        node* cur = root;
        cur->sz++;
        for (int i = 30; i >= 0; i--) {
            int b = (x>>i)&1;
            if (cur->nxt[b] == NULL) cur->nxt[b] = new node();
            cur = cur->nxt[b];
            cur->sz++;
        }
    }
    long long query(int x, int k) {
        node* cur = root;
        long long ans = 0;
        for (int i = 30; i >= 0; i--) {
            if (cur == NULL) break;
            int b1 = (x>>i)&1;
            int b2 = (k>>i)&1;
            if (b2 == 1) {
                if (cur->nxt[b1]) ans += cur->nxt[b1]->sz;
                cur = cur->nxt[!b1];
            } else cur = cur->nxt[b1];
        }
        return ans;
    }
};

int x, y, z, a[N][N][N];
Trie t[N][N][N];
void dfs1(int u, int v, int w, int cur) {
	if (u < 0 || v < 0 || w < 0 || u >= x || v >= y || w >= z) return;
	cur ^= a[u][v][w];
	if (u + v + w == (x + y + z) / 2 - 1) {
		t[u][v][w].insert(cur);
		return;
	}
	dfs1(u + 1, v, w, cur);
	dfs1(u, v + 1, w, cur);
	dfs1(u, v, w + 1, cur);
}
long long ans = 0;
int k;
void dfs2(int u, int v, int w, int cur) {
	if (u < 0 || v < 0 || w < 0 || u >= x || v >= y || w >= z) return;
	if (u + v + w == (x + y + z) / 2 - 1) {
		ans += t[u][v][w].query(cur, k + 1);
		return;
	}
	cur ^= a[u][v][w];
	dfs2(u - 1, v, w, cur);
	dfs2(u, v - 1, w, cur);
	dfs2(u, v, w - 1, cur);
}
int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> x >> y >> z;
	cin >> k;
	for (int i = 0; i < x; i++) {
		for (int j = 0; j < y; j++) {
			for (int k = 0; k < z; k++) {
				cin >> a[i][j][k];
			}
		}
	}
	dfs1(0, 0, 0, 0);
	dfs2(x - 1, y - 1, z - 1, 0);
	cout << ans << '\n';
    return 0;
}