#include<cstdio>
#include<algorithm>
using namespace std;
struct js {
	int val;
	int id;
}a[1000000];
int b[1000000];
bool cmp1(js a, js b) {
	if (a.val != b.val) return a.val < b.val;
	else return a.id < b.id;
}
bool cmp2(js a, js b) {
	return a.id < b.id;
}
int main() {
	int n, q;
	scanf_s("%d%d", &n, &q);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i].val), a[i].id = i;
	sort(a + 1, a + n + 1, cmp1);
	for (int i = 1; i <= n; i++)
		b[a[i].id] = i;
	sort(a + 1, a + n + 1, cmp2);
	while (q--) {
		int num;
		scanf("%d", &num);
		int x, v;
		if (num == 1) {
			scanf("%d%d", &x, &v);
			a[x].val = v;
			sort(a + 1, a + n + 1, cmp1);
			for (int i = 1; i <= n; i++)
				b[a[i].id] = i;
			sort(a + 1, a + n + 1, cmp2);
		}
		if (num == 2) {
			scanf("%d", &x);
			printf("%d\n", b[x]);
		}
	}
	return 0;
}