#include <bits/stdc++.h>
using namespace std;
int n, Q, op, x, v, a[8005], b[8005];
int main()
{
    cin >> n >> Q;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    while (Q--)
    {
        memset(b, 0, sizeof(b));
        cin >> op;
        if (op == 1)
        {
            cin >> x >> v;
            a[x] = v;
        }
        else
        {
            cin >> x;
            for (int i = 1; i <= n; i++)
            {
                b[i] = a[i];
            }
            int indexs = x;
            for (int i = 1; i <= n; i++)
            {
                for (int j = i; j >= 2; j--)
                {
                    if (b[j] < b[j- 1])
                    {
                        if (j == indexs)
                        {
                            indexs = j - 1;
                        }
                        else if (j - 1 == indexs)
                        {
                            indexs = j;
                        }
                        int t = b[j- 1];
                        b[j- 1] = b[j];
                        b[j] = t;
                    }
                }
            }
            cout << indexs << endl;
        }
    }
    return 0;
}