#include<bits/stdc++.h>
using namespace std;

const int N = 10010;

typedef long long LL;

int h[N],a[N];
int n,q,res;
struct 	Node 
{
	int num,indx;
	bool st;	
}node[N],num[N];

bool cmp(Node A,Node B)
{
	return A.num < B.num;
}

int bsort(Node node[],int ans)
{
	Node arr[N];
	for(int i =1;i<=n;i++)arr[i] = node[i];
	
	stable_sort(arr + 1,arr + n + 1,cmp);
	
	for(int i = 1;i<=n;i++)
		if(arr[i].st)return i;
}

int main()
{
	
	cin>>n>>q;
	
	for(int i =1;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		node[i] = {x,i,false};
	}
	while(q--)
	{
		int op,x,v;
		scanf("%d",&op);
		if(op == 1) 
		{
			scanf("%d%d",&x,&v);
			node[x].num = v;
		}
		else 
		{
			int t[N];
			scanf("%d",&x);
			int ans = node[x].num;
			node[x].st = true;
			
			int c = bsort(node,ans);
			
			node[x].st = false;
			
			printf("%d\n",c);
		}
		
	} 
	return 0;
	
}