#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cstring>
#define maxn 300005
using namespace std;
int n,m,a[maxn],opt,ai,bi,dad[maxn],sum,lazy[maxn];
int find(int x){
	if(x==dad[x]) return x;
	else{
		find(dad[x]);
		lazy[x]^=lazy[dad[x]];
		dad[x]=dad[dad[x]];
		return dad[x];
	}
}
void query(int x){
	 sum=a[find(x)]^lazy[x];
     printf("%d\n",sum); 	 
} 
int main(){
    freopen("td.in","r",stdin);
    freopen("td.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
	    scanf("%d",&a[i]);
	    dad[i]=i;
	}
    while(m--){
          scanf("%d",&opt);
          switch(opt){
                 case 1:scanf("%d%d",&ai,&bi);lazy[find(ai)]=a[dad[ai]];dad[dad[ai]]=bi;break;
                 case 2:scanf("%d",&ai);query(ai);break;
          }
    }
    //system("pause");
	return 0; 
}