#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;

#define MAX 300000
int a[MAX], n, m, op, x, y, sol;

void update(int n, int l, int r) {
    if (l == r) {
        a[n] = y;
    } else {
        int m = (l+r)/2;
        if (x <= m) update(2*n, l, m); else
                    update(2*n+1, m+1, r);
        a[n] = max(a[2*n], a[2*n+1]);
    }
}

void query(int n, int l, int r) {
    if (x <= l && r <= y) {
        sol = max(sol, a[n]);
    } else {
        int m = (l+r)/2;
        if (x <= m) query(2*n, l, m);
        if (y > m) query(2*n+1, m+1, r);
    }
}

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &y);
        x = i;
        update(1,1,n);
    }
    for (int i = 1; i <= m; i++) {
        scanf("%d %d %d", &op, &x, &y);
        if (op==0) {
            sol = 0;
            query(1,1,n);
            printf("%d\n", sol);
        } else {
            update(1,1,n);
        }
    }
    return 0;
}