//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x;
}
void write(int x) {
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int T,N,Q,ct,st[250009],a[250009];
std::unordered_map<LL,int> vi;
int f(int x,int y) {
	if(x==0) return a[y];
	int m=vi[1ll*x*N+y]; 
	if(m) return m-1;
	int as=f(x-(1<<st[x]),y);
	if(y>(1<<st[x])) as^=f(x-(1<<st[x]),y-(1<<st[x]));
	vi[1ll*x*N+y]=as+1;
	return as;
}
void fc(void) {
    for(int i=1;i<=Q;i++) {
    	for(int j=19;j>=0;j--) {
    		if((i>>j)&1) {
    			st[i]=j;
    			break;
			}
		}
	}
	while(Q--) {
		int op=read();
		if(op==1) {
			int l=read(),r=read();
			ct++;
		} else {
			int x=read();
			we(f(ct,x));
		}
	}
	for(int i=0;i<=19;i++) {
		if((ct>>i)&1) {
			for(int j=N;j>(1<<i);j--) {
				a[j]^=a[j-(1<<i)];
			}
		}
	}
	for(int i=1;i<=N;i++) we(a[i]);
	pcc();	
}
signed main(void) {
   // freopen("m.in","r",stdin);
   // freopen("m.out","w",stdout);
    T=read();N=read();Q=read();
    if(T==4||T==5||T==6) {
    	fc();
    	return 0;
	}
	for(int i=1;i<=N;i++) {
    	a[i]=read(); 
	}
	while(Q--) {
		int op=read();
		if(op==1) {
			int l=read(),r=read();
			for(int i=r;i>l;i--) a[i]^=a[i-1];
		} else {
			int x=read();
			we(a[x]);
		}
	} 
	for(int i=1;i<=N;i++) we(a[i]);
	pcc();		
    return 0;
}