#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10;
int n,m,ans[N];
struct student {
int num;
int id;
}a[8010];
bool cmp(student u,student v) {
if (u.num != v.num) {
return u.num < v.num;
}
return u.id < v.id;
}
signed main(){
int n,m;
cin>>n>>m;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
a[i].id = i;
}
sort(a+1,a+1+n,cmp);
for (int i = 1; i <= n; i++) {
ans[a[i].id] = i;
}
while (m--) {
int t;
cin>>t;
if (t == 1) {
int x,y;
cin>>x>>y;
int id = ans[x];
a[id].num = y;
while (id>1&&!cmp(a[id-1],a[id]))
{
swap(a[id-1],a[id]);
id--;
}
while (id<n&&!cmp(a[id],a[id+1])) {
swap(a[id],a[id+1]);
id++;
}
for (int i = 1; i <= n; i++) {
ans[a[i].id] = i;
}
}else {
int x;
cin >> x;
cout << ans[x] << endl;
}
}
return 0;
}
