#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
using namespace std;
const int N=3e5+5,B=256,M=1e3+5;
int cnt[M],val[M][B],T,n,q,a[N],ks[N],L[M],R[M],m,opt,l,r,tmp1[B],tmp[M][B];
void fwt(int *f,int opt){
	for(int i=1;i<B;i*=2)
		for(int j=0;j<B;j+=2*i)
			rep(k,0,i) (opt?f[j+k]^=f[i+j+k]:f[i+j+k]^=f[j+k]);
}
void pu(int x){rep(i,0,B-1) val[x][i]=(L[x]+i>R[x]?0:a[R[x]-i]); fwt(val[x],0);}
void pd(int x){
	rep(i,0,8) if((cnt[x]>>i)&1) per(j,B-1,(1<<i)) a[L[x]+j]^=a[L[x]+j-(1<<i)];
	rep(i,0,B-1) tmp1[i]=0;
	rep(i,1,cnt[x]) tmp1[cnt[x]-i]=tmp[x][i];
	fwt(tmp1,1);
	rep(i,0,B-1) a[L[x]+i]^=tmp1[i];
	cnt[x]=0;
}
void gx(int l,int r){
	if(ks[l]==ks[r]){pd(ks[l]); per(i,r,l+1) a[i]^=a[i-1]; pu(ks[l]);}
	else{
		pd(ks[l]); int lst=a[R[ks[l]]]; per(i,R[ks[l]],l+1) a[i]^=a[i-1]; pu(ks[l]);
		rep(i,ks[l]+1,ks[r]){
			tmp[i][++cnt[i]]=lst,lst=val[i][cnt[i]-1];
			if(cnt[i]==B-1) pd(i),pu(i);
		}
		pd(ks[r]); per(i,r,L[ks[r]]+1) a[i]^=a[i-1]; pu(ks[r]);
	}
}
signed main(){
	scanf("%d",&T);
	scanf("%d%d",&n,&q);
	rep(i,1,n) scanf("%d",&a[i]),ks[i]=(i-1)/B+1;
	m=ks[n];
	rep(i,1,m) L[i]=(i-1)*B+1,R[i]=min(n,i*B),pu(i); 
	rep(i,1,q){
		scanf("%d%d",&opt,&l);
		if(opt==1) scanf("%d",&r),gx(l,r);
		else pd(ks[l]),pu(ks[l]),printf("%d\n",a[l]);
	}
	rep(i,1,m) pd(i);
	rep(i,1,n) printf("%d\n",a[i]);
	return 0;
}