#include<bits/stdc++.h>
#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+5;
int C=40;//块的总数

int n,m,S;//S:块长
int sz[N],fa[N];
short siz[N][42];//siz[i][j]:第 i 个数所在的并查集在值域的第 j 块的数量
int U[N],V[N],ans[N],head[N],cnt;
struct Edge {
	int u,v;
}e[N];
pair<int,int> node[N];
char op[N];
inline int find(int u) {
	while (u!=fa[u]) u=fa[u];
	return u;
}
inline void add(int u,int v) { 
	e[++cnt].u=head[u]; 
	e[cnt].v=v;
	head[u]=cnt;
	return ;
}
inline void dfs(int u) {
	bool did=0;
	int L,R;
	if (op[u]=='1') {
		U[u]=find(U[u]),V[u]=find(V[u]);
		if (U[u]!=V[u]) {
			did=1;
			if (sz[U[u]]<sz[V[u]]) {
				fa[U[u]]=V[u];
				sz[V[u]]+=sz[U[u]];
				L=U[u],R=V[u];
				for (int i=1;i<=C;i++) siz[V[u]][i]+=siz[U[u]][i];
			}
			else {
				fa[V[u]]=U[u];
				sz[U[u]]+=sz[V[u]];
				L=V[u],R=U[u];
				for (int i=1;i<=C;i++) siz[U[u]][i]+=siz[V[u]][i];
			}
		}
	}
	else if (op[u]=='3') {
		int rt=find(U[u]),loc=0;
		if (sz[rt]<V[u]) ans[u]=-1;
		else {
//		for (int i=1;i<=n;i++) {
//			if (find(i)==rt) cout<<i<<" ";
//		}
//		cout<<endl;
			for (int i=1;i<=C;i++) {
				if (V[u]>siz[rt][i]) V[u]-=siz[rt][i];
				else {
					loc=i;
					break;
				}
//				V[u]-=siz[rt][i];
//				if (V[u]<=0) {
//					V[u]+=siz[rt][i];
//					loc=i;
//					break;
//				}
			}
//		cout<<endl;
			for (int i=(loc-1)*S+1;i<=loc*S and V[u];i++) {
				if (rt==find(i)) V[u]--,ans[u]=node[i].first;
			}
		}
	}
	for (int i=head[u];i;i=e[i].u) dfs(e[i].v);
	if (did) {
		sz[R]-=sz[L];
		fa[L]=L;
		for (int i=1;i<=C;i++) siz[R][i]-=siz[L][i];
	}
	return ;
}
signed main() {
	cin>>n>>m;S=n/C+1;C=(n-1)/S+1;
	for (int i=1;i<=n;i++) cin>>node[i].first,node[i].second=i,sz[i]=1,fa[i]=i; 
	sort(node+1,node+n+1);
	for (int i=1;i<=n;i++) {
		int loc=(i-1)/S+1;
		siz[node[i].second][loc]++;
	}
	for (int i=1;i<=m;i++) {
		cin>>op[i];
		if (op[i]=='1') {
			add(i-1,i);
			cin>>U[i]>>V[i];
		}
		if (op[i]=='2') {
			cin>>U[i];
			add(U[i],i);
		}
		if (op[i]=='3') {
			add(i-1,i);
			cin>>U[i]>>V[i];
		}
	}
	dfs(1);
	for (int i=1;i<=m;i++) if (op[i]=='3') cout<<ans[i]<<endl;
	return (0-0);
}