#include<bits/stdc++.h>
#define int long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define randfind(l,r) (rand()%((r)-(l)+1)+(l))
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxq=5e5+10,Maxn=3e5+10;
int n,q;
int a[Maxn];
int T;
inline void init(){
    T=read();
    n=read();q=read();
    fr(i,1,n) a[i]=read();
}
struct node{
    int type;
    int l,r;
    int x;
}e[Maxq];
namespace sub1{
    inline void work(){
        fr(i,1,q){
            if(e[i].type==2){
                writeln(a[e[i].x]);
                continue;
            }
            rf(j,e[i].r,e[i].l+1) a[j]=a[j]^a[j-1];
        }
        fr(i,1,n) writeln(a[i]);
        return;
    }
}
inline void work(){
    fr(i,1,q) {
        e[i].type=read();
        if(e[i].type==1) e[i].l=read(),e[i].r=read();
        else e[i].x=read();
    }
    if(T==1){
        sub1::work();
        return;
    }
}
signed main(){
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}