#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=1e6+10;
int n,q,a[N];
struct Segment_Tree{
	#define ls (rt<<1)
	#define rs (rt<<1|1)
	int tag[N<<2],mn[N<<2];
	inline void pushup(int rt){
		mn[rt]=min(mn[ls],mn[rs]);
	}
	inline void pushtag(int rt,int v){
		tag[rt]+=v,mn[rt]+=v;
	}
	inline void pushdown(int rt){
		if(!tag[rt]) return ;
		pushtag(ls,tag[rt]),pushtag(rs,tag[rt]);
		tag[rt]=0;
	}
	inline void add(int rt,int l,int r,int L,int R,int v){
		if(L<=l&&r<=R) return pushtag(rt,v);
		pushdown(rt);
		int mid=l+r>>1;
		if(L<=mid) add(ls,l,mid,L,R,v);
		if(R>mid) add(rs,mid+1,r,L,R,v);
		pushup(rt);
	}
	inline int find(int rt,int l,int r,int L,int R){
		if(r<L||l>R||mn[rt]) return -1;
		if(l==r) return l;
		pushdown(rt);
		int mid=l+r>>1,res=find(rs,mid+1,r,L,R);
		if(res==-1) res=find(ls,l,mid,L,R);
		return res;
	}
}T;
int main(){
//	freopen("anoko4.in","r",stdin);
//	freopen("anoko4.out","w",stdout);
	n=read(),q=read();
	for(int i=1;i<=n;i++)
		a[i]=read();
	for(int i=1;i<=n;i++)
		if(a[i]<i)
			T.add(1,1,n,a[i]+1,i,1);
	while(q--){
		int op=read(),x=read();
		if(op==1){
			if(a[x]<x) T.add(1,1,n,a[x]+1,x,-1);
			a[x]=read();
			if(a[x]<x) T.add(1,1,n,a[x]+1,x,1);
		}else{
			int p=T.find(1,1,n,1,x);
			write(p),putc('\n');
		}
	}
	flush();
}