#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5 + 5;

int n, m;
int v[maxn];
int arb[maxn * 2];

int a, b;

void update(int nod, int st, int dr)  {
    if(st == dr)  {
        arb[nod] = b;
        return;
    }
    int mid = (st + dr) / 2;
    if(st <= a && mid >= a)  {
        update(nod * 2, st, mid);
    }
    else  {
        update(nod * 2 + 1, mid + 1, dr);
    }
    arb[nod] = max(arb[2 * nod], arb[2 * nod + 1]);
}

int bst;

void query(int nod, int st, int dr)  {
    if(st > dr)
        return;
    if(dr < a)
        return;
    if(st > b)
        return;
    if(a <= st && dr <= b)  {
        bst = max(bst, arb[nod]);
        return;
    }
    int mid = (st + dr) / 2;
    query(2 * nod, st, mid);
    query(2 * nod + 1, mid + 1, dr);
}

int main()  {
    ifstream cin("arbint.in");
    freopen("arbint.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
        cin >> v[i], a = i, b = v[i], update(1, 1, n);
    a = 3, b = 3;
    query(1, 1, n);
    for(int i = 1;i <= m;i++)  {
        int op;
        cin >> op >> a >> b;
        if(op == 0)  {
            bst = INT_MIN;
            query(1, 1, n);
            printf("%d\n", bst);
        }
        else  {
            update(1, 1, n);
        }
    }
    return 0;
}