#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
    return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=2.5e5+10;
int n,m,q,a[N],b[N],is[N];
vector<int>idx;
ll res[N],ans[N];
vector<pair<int,int>>que[N];
int pos[N],bg[N],ed[N];
vector<int>laz[N];
void rebuild(int id){
    int *a=::a+bg[id],*b=::b+bg[id],len=ed[id]-bg[id]+1;
    for(int i=0;i<len;++i) b[i]=a[len-i];
    copy(a,a+len,b);
    for(int i=0;(1<<i)<len;i++){
        for(int j=0;j<len;j++){
            if(j>>i&1)b[j]^=b[j^1<<i];
        }
    }
}
void reduce(int id){
    int S=laz[id].size();
    int *a=::a+bg[id],len=ed[id]-bg[id]+1;
    for(int i=0;(1<<i)<=min(S,len-1);i++)if(S>>i&1){
        for(int j=len-1;j>=(1<<i);j--){
            a[j]^=a[j-(1<<i)];
        }
    }
    reverse(all(laz[id]));
    for(int i=0;(1<<i)<S;i++){
        for(int j=S-1;j>=0;j--){
            if(j>>i&1)laz[id][j^1<<i]^=laz[id][j];
        }
    }
    for(int i=0;i<S&&i<len;i++)a[i]^=laz[id][i];
    laz[id].clear();
}
int back(int id){
    int d=ed[id]-bg[id];
    if(laz[id].size()>d)reduce(id),rebuild(id);
    int cnt=laz[id].size();
    return b[cnt];
}
void update(int l,int r){
    if(pos[l]==pos[r]){
        reduce(pos[l]);
        for(int i=r;i>l;i--)a[i]^=a[i-1];
        return rebuild(pos[l]);
    }
    reduce(pos[r]);
    for(int i=r;i>bg[pos[r]];i--)a[i]^=a[i-1];
    a[bg[pos[r]]]^=back(pos[r]-1);
    rebuild(pos[r]);
    for(int i=pos[r]-1;i>pos[l];i--){
        laz[i].push_back(back(i-1));
    }
    reduce(pos[l]);
    for(int i=ed[pos[l]];i>l;i--)a[i]^=a[i-1];
    rebuild(pos[l]);
}
int query(int i){
    reduce(pos[i]),rebuild(pos[i]);
    return a[i];
}
int main(){
//    freopen("sgt.in","r",stdin);
//    freopen("sgt.out","w",stdout);
    scanf("%*d%d%d",&n,&m),q=0;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1,x,y;i<=q;i++){
        scanf("%d%d",&x,&y);
        idx.push_back(x),is[x]=1;
        if(y)que[y].push_back({x,i});
        else ans[i]=a[x];
    }
    sort(all(idx)),idx.erase(unique(all(idx)),idx.end());
    for(int x:idx)res[x]=a[x];
    int B=1<<9;
    for(int i=1,p=1,cnt=0;i<=n;i++){
        if(is[i-1]||cnt==B)cnt=0,p++;
        pos[i]=p,cnt++;
    }
    for(int i=1;i<=n;i++)ed[pos[i]]=i;
    for(int i=n;i>=1;i--)bg[pos[i]]=i;
    for(int i=1;i<=pos[n];i++)rebuild(i);
    for(int i=1,op,x,y;i<=m;i++){
        scanf("%d%d",&op,&x);
        if(op==1){
            scanf("%d",&y);
            update(x,y);
        }else{
            printf("ans = %d\n",query(x));
        }
        for(int x:idx)res[x]+=back(pos[x]);
//        for(auto [x,id]:que[i])ans[id]=res[x];
    }
    for(int i=1;i<=pos[n];i++)reduce(i);
    for(int i=1;i<=n;i++)printf("%d\n",a[i]);
    for(int i=1;i<=q;i++)printf("%lld\n",ans[i]);
    return 0;
}