#include<bits/stdc++.h>
#define N 8010
using namespace std;
struct node{
	int v;
	int p;
}a[N],b[N];
int n,q,f,x,y;
bool cmp(node x,node y){
	return(x.v==y.v?x.p<y.p:x.v<y.v);
}
int main(){
	cin>>n>>q;
	for(int i=1;i<=n;i++)cin>>a[i].v,a[i].p=i,b[i]=a[i];
	q--;
	sort(b+1,b+n+1,cmp),sort(a+1,a+n+1,cmp);
	cin>>f;
	if(f==2)cin>>x,cout<<b[x].p<<"\n";
	else cin>>x>>y,b[x].v=y,a[x].v=y;
	while(q--){
		cin>>f;
		if(f==2)cin>>x,cout<<b[x].p<<"\n";
		else cin>>x>>y,b[x].v=y,a[x].v=y,sort(b+1,b+n+1,cmp),sort(a+1,a+n+1,cmp);
	}
	return 0;
}