好像基本都优化完了吧？！

#include<bits/stdc++.h>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
using namespace std;
namespace fast_IO {
#define IOSIZE 100000
	char ibuf[IOSIZE], obuf[IOSIZE], *p1 = ibuf, *p2 = ibuf, *p3 = obuf;
#define getchar() ((p1==p2)and(p2=(p1=ibuf)+fread(ibuf,1,IOSIZE,stdin),p1==p2)?(EOF):(*p1++))
#define putchar(x) ((p3==obuf+IOSIZE)&&(fwrite(obuf,p3-obuf,1,stdout),p3=obuf),*p3++=x)
#define isdigit(ch) (ch>47&&ch<58)
#define isspace(ch) (ch<33)
	template<typename T> inline T read() { T s = 0; int w = 1; char ch; while (ch = getchar(), !isdigit(ch) and (ch != EOF)) if (ch == '-') w = -1; if (ch == EOF) return false; while (isdigit(ch)) s = s * 10 + ch - 48, ch = getchar(); return s * w; }
	template<typename T> inline bool read(T &s) { s = 0; int w = 1; char ch; while (ch = getchar(), !isdigit(ch) and (ch != EOF)) if (ch == '-') w = -1; if (ch == EOF) return false; while (isdigit(ch)) s = s * 10 + ch - 48, ch = getchar(); return s *= w, true; }
	template<typename T> inline void print(T x) { if (x < 0) putchar('-'), x = -x; if (x > 9) print(x / 10); putchar(x % 10 + 48); }
	inline bool read(char &s) { while (s = getchar(), isspace(s)); return true; }
	inline bool read(char *s) { char ch; while (ch = getchar(), isspace(ch)); if (ch == EOF) return false; while (!isspace(ch)) *s++ = ch, ch = getchar(); *s = '\000'; return true; }
	inline void print(char x) { putchar(x); }
	inline void print(char *x) { while (*x) putchar(*x++); }
	inline void print(const char *x) { for (int i = 0; x[i]; i++) putchar(x[i]); }
	inline bool read(std::string& s) { s = ""; char ch; while (ch = getchar(), isspace(ch)); if (ch == EOF) return false; while (!isspace(ch)) s += ch, ch = getchar(); return true; }
	inline void print(std::string x) { for (int i = 0, n = x.size(); i < n; i++) putchar(x[i]); }
	inline bool read(bool &b) { char ch; while(ch=getchar(), isspace(ch)); b=ch^48; return true; }
	inline void print(bool b) { putchar(b+48); }
	template<typename T, typename... T1> inline int read(T& a, T1&... other) { return read(a) + read(other...); }
	template<typename T, typename... T1> inline void print(T a, T1... other) { print(a), print(other...); }
	struct Fast_IO { ~Fast_IO() { fwrite(obuf, p3 - obuf, 1, stdout); } } io;
	template<typename T> Fast_IO& operator >> (Fast_IO &io, T &b) { return read(b), io; }
	template<typename T> Fast_IO& operator << (Fast_IO &io, T b) { return print(b), io; }
#define cout io
#define cin io
#define endl '\n'
} using namespace fast_IO;
const int N=1e5+10;
const int S=350;
const int INF=1e7;
int n,m,e[N];
int L[N],R[N],f[N][S+10];
int B,bel[N];
int b[N],num[S+10],tmp[2][N];
int rel[N][S],bl[S][S+10],br[S][S+10];
bool used[N][S];
int lst;
inline void build(int loc) {
	int l=L[loc],r=R[loc],siz=0;
	for (int i=l;i<=r;i++) b[++siz]=e[i];
	sort(b+1,b+siz+1);
	siz=unique(b+1,b+siz+1)-b-1;
	num[loc]=siz;
	for (int i=1;i<=siz;i++) {
		rel[b[i]][loc]=i;
		used[loc][i]=true;
	}
	memset(tmp,128,sizeof tmp);
	for (int i=l;i<=r;i++) {
		e[i]=rel[e[i]][loc];
		if (tmp[0][e[i]]<0) tmp[0][e[i]]=i;
		tmp[1][e[i]]=i;
		int u=e[i],U=L[loc]+u-1;
		for (int j=1;j<u;j++) f[L[loc]+j-1][u]=min(i-tmp[1][j],f[L[loc]+j-1][u]);
		for (int j=u+1;j<=siz;j++) f[U][j]=min(i-tmp[1][j],f[U][j]);
	}
	for (int i=1;i<=siz;i++) {
		bl[loc][i]=tmp[0][i];
		br[loc][i]=tmp[1][i];
	}
	return ;
}
inline void update(int x,int y) {
	if (x==y) return ;
	for (int i=1;i<=B;i++) {
		int u=rel[x][i],v=rel[y][i];
		if (!u) continue;
		if (!v) {
			rel[y][i]=u;
			rel[x][i]=0;
			continue;
		}
		used[i][u]=0,rel[x][i]=0;
		bl[i][v]=min(bl[i][v],bl[i][u]);
		br[i][v]=max(br[i][v],br[i][u]);
		int p=L[i]+u,q=L[i]+v;
		if (u<v) {
			for (int j=1;j<u;j++) 
				if (used[i][j])
					f[L[i]+j][v]=min(f[L[i]+j][u],f[L[i]+j][v]);
			for (int j=u+1;j<v;j++)
				if (used[i][j])
					f[L[i]+j][v]=min(f[p][j],f[L[i]+j][v]);
			for (int j=v+1;j<=num[i];j++)
				if (used[i][j])
					f[q][j]=min(f[p][j],f[q][j]);
		}
		else {
			for (int j=1;j<v;j++) 
				if (used[i][j])
					f[L[i]+j][v]=min(f[L[i]+j][u],f[L[i]+j][v]);
			for (int j=v+1;j<u;j++)
				if (used[i][j])
					f[q][j]=min(f[L[i]+j][u],f[q][j]);
			for (int j=u+1;j<=num[i];j++)
				if (used[i][j])
					f[q][j]=min(f[p][j],f[q][j]);
		}
	}
	return ;
}
inline int query(int x,int y) {
	int ans=INF,ll=-INF,rr=-INF;
	if (x==y) {
		for (int i=1;i<=B;i++) 
			if (rel[x][i])
				return 0;
		return INF;
	}
	for (int i=1;i<=B;i++) {
		int u=rel[x][i],v=rel[y][i];
		if (ans==1) return 1;
		if (u and v) {
			if (u<v) ans=min(ans,f[L[i]+u][v]);
			else ans=min(ans,f[L[i]+v][u]);
			ans=min(ans,bl[i][u]-rr);
			ans=min(ans,bl[i][v]-ll);
			ll=br[i][u],rr=br[i][v];
			continue;
		}
		int p=ll,q=rr;
		if (u) ans=min(ans,bl[i][u]-rr),p=br[i][u];
		if (v) ans=min(ans,bl[i][v]-ll),q=br[i][v];
		ll=p,rr=q;
	}
	return ans;
}
inline void init() {
	B=n/S;
	for (int i=1;i<=B;i++) L[i]=R[i-1]+1,R[i]=R[i-1]+S;
	if (R[B]<n) {
		B++;
		L[B]=R[B-1]+1,R[B]=n;
	}
	for (int i=1;i<=n;i++) 
		for (int j=0;j<=S;j++) 
			f[i][j]=S+10;
	for (int i=1;i<=B;i++) {
		for (int j=L[i];j<=R[i];j++) 
			bel[j]=i;
		build(i);
	}
	for (int i=1;i<=B;i++) L[i]--;
	return ;
}
signed main() {
	cin>>n>>m;
	for (int i=1;i<=n;i++) cin>>e[i];
	init();
	while (m--) {
		int op,x,y;
		cin>>op>>x>>y;
		x^=lst,y^=lst;
		if (op==1) update(x,y);
		else {
			lst=query(x,y);
			if (lst==INF) cout<<"Ikaros"<<endl,lst=0;
			else cout<<lst<<endl;
		}
	}
	return (0-0);
}