#include <bits/stdc++.h>
using namespace std;
const int MAXN = 250005;
const int B = 600;
int id;
int n, q, a[MAXN], b[MAXN], c[MAXN];
int qc, qt[MAXN], ql[MAXN], qr[MAXN], qx[MAXN], qid[MAXN];
int qq;
int bl[MAXN], L[MAXN], R[MAXN];
void update(int i, int cc) {
    for (int j = 1; j <= cc; j <<= 1) if (cc & j) {
        for (int k = R[i]; k - j >= max(1, L[i - 1]); k--) b[k] ^= b[k - j];
    }
}
int ans[MAXN];
void rebuild() {
    for (int i = (bl[n] == 1 ? 1 : 2); i <= bl[n]; i++) {
        int ll = (i == 2 ? 1 : L[i]), rr = R[i];
        for (int j = L[i - 1]; j <= R[i]; j++) b[j] = a[j];
        int cc = 0;
        for (int j = 1; j <= qc; j++) {
            if (qt[j] == 1) {
                if (qr[j] < L[i - 1] || ql[j] > R[i]) continue;
                if (ql[j] <= L[i - 1] && R[i] <= qr[j]) {
                    cc++;
                    continue;
                }
                update(i, cc), cc = 0;
                for (int k = min(R[i], qr[j]); k > max(L[i - 1], ql[j]); k--) b[k] ^= b[k - 1];
            } else {
                update(i, cc), cc = 0;
                if (qx[j] < ll || qx[j] > rr) continue;
                ans[qid[j]] = b[qx[j]];
            }
        }
        update(i, cc);
        for (int j = ll; j <= rr; j++) c[j] = b[j];
    }
    for (int i = 1; i <= n; i++) a[i] = c[i];
    // for (int i = 1; i <= n; i++) printf("%d ", a[i]);
    // printf("\n");
    qc = 0;
}
int main() {
    // freopen("xor.in", "r", stdin);
    // freopen("xor.out", "w", stdout);
    scanf("%d%d%d", &id, &n, &q);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int l = 1, r, i = 1; l <= n; l = r + 1, i++) {
        r = min(n, l + B - 1);
        L[i] = l, R[i] = r;
        for (int j = l; j <= r; j++) bl[j] = i;
    }
    for (int i = 1; i <= q; i++) {
        int op; scanf("%d", &op);
        ++qc;
        if (op == 1) {
            int l, r; scanf("%d%d", &l, &r);
            qt[qc] = 1, ql[qc] = l, qr[qc] = r;
        } else {
            int x; scanf("%d", &x);
            qt[qc] = 2, qx[qc] = x, qid[qc] = ++qq;
        }
        if (qc == B) rebuild();
    }
    rebuild();
    for (int i = 1; i <= qq; i++) printf("%d\n", ans[i]);
    for (int i = 1; i <= n; i++) printf("%d\n", a[i]);
    return 0;
}