#include <bits/stdc++.h>

using namespace std;

int v[100005], aint[400005];
int qlf, qrg, val;

void build(int pos, int lf, int rg){
    if(lf == rg){
        aint[pos] = v[lf];
        return;
    }
    int md = (lf + rg)/2;
    build(2 * pos, lf, md);
    build(2 * pos + 1, md + 1, rg);
    aint[pos] = max(aint[2 * pos], aint[2 * pos + 1]);
}

void update(int pos, int lf, int rg){
    if(lf > qlf || rg < qlf){
        return;
    }else if(lf == rg){
        aint[pos] = val;
        return;
    }
    int md = (lf + rg)/2;
    update(2 * pos, lf, md);
    update(2 * pos + 1, md + 1, rg);
    aint[pos] = max(aint[2 * pos], aint[2 * pos + 1]);
}

int query(int pos, int lf, int rg){
    if(lf > qrg || rg < qlf){
        return -1;
    }else if(qlf <= lf && rg <= qrg){
        return aint[pos];
    }
    int md = (lf + rg)/2;
    return max(query(2 * pos, lf, md), query(2 * pos + 1, md + 1, rg));
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    int n,q,i;
    scanf("%d %d", &n, &q);
    for(i = 1;i <= n;i++){
        scanf("%d", &v[i]);
    }
    build(1, 1, n);
    for(i = 1;i <= q;i++){
        int op;
        scanf("%d", &op);
        if(op == 1){
            scanf("%d %d", &qlf, &val);
            update(1, 1, n);
        }else{
            scanf("%d %d", &qlf, &qrg);
            printf("%d\n", query(1, 1, n));
        }
    }
    return 0;
}