#include <bits/stdc++.h>
using namespace std;
int n, q, x, target, v, op, arr[8005];
int main() {
	freopen("sort.in", "r", stdin);
	freopen("sort.out", "w", stdout);
	scanf("%d %d\n", &n, &q);
	int arr[8005];
	for (int i = 1; i <= n; i++) scanf("%d ", &arr[i]);
	scanf("\n");
	for (int i = 1; i <= q; i++) {
		scanf("%d ", &op);
		if (op == 1) {
			scanf("%d %d\n", &x, &v);
			arr[x] = v;
		} else if (op == 2) {
			int sum = 0;
			scanf("%d\n", &x);
			target = arr[x];
			for (int j = 1; j <= n; j++) {
				if (arr[j] < target || arr[j] == target && j < x) {
					sum++;
				} else continue;
			}
			printf("%d\n", (sum + 1));
		}
	}
	return 0;
}