88pts TLE 求条 马风良好

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748#include<bits/stdc++.h>
using namespace std;
int n,Q,order[8005];
struct node{
	int inx,value;
}a[8005];
inline int read() {
	int n=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)) {
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)) {
		n=n*10+ch-'0';
		ch=getchar();
	}
	return f*n;
}
inline void write(int n) {
	if(n<0) putchar('-'),n=-n;
	if(n<10) putchar(n+'0');
	else write(n/10),putchar(n%10+'0');
}
inline bool cmp(const node &a,const node &b) {
	if(a.value!=b.value) return a.value<b.value;
	return a.inx<b.inx;
}
int main() {
	n=read(),Q=read();
	for(int i=1;i<=n;i++) {
		a[i].value=read();
		a[i].inx=i;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++) order[a[i].inx]=i;
	while(Q--) {
		int i=read(),x=read(),v;
		if(i==1) {
			v=read();
			a[order[x]].value=v;
			sort(a+1,a+n+1,cmp);
			for(int i=1;i<=n;i++) order[a[i].inx]=i;
		}
		else write(order[x]),putchar('\n');
	}
	return 0;
}