#include <bits/stdc++.h>
#define nmax 100000

using namespace std;

ifstream fin("arbint.in");
ofstream fout("arbint.out");

int v[nmax+5], aint[4*nmax+5];

void build(int nod, int st, int dr) {
    if(st == dr) {
        aint[nod] = v[st];
        return;
    }
    int mid = (st + dr) / 2;
    build(2*nod, st, mid);
    build(2*nod+1, mid+1, dr);
    aint[nod] = max(aint[2*nod], aint[2*nod+1]);
}

void update(int nod, int st, int dr, int pos, int val) {
    if(st == dr) {
        aint[nod] = val;
        return;
    }
    int mid = (st + dr) / 2;
    if(pos <= mid) {
        update(2*nod, st, mid, pos, val);
    } else {
        update(2*nod+1, mid+1, dr, pos, val);
    }
    aint[nod] = max(aint[2*nod], aint[2*nod+1]);
}

int query(int nod, int st, int dr, int left, int right) {
    if(st >= left && dr <= right) {
        return aint[nod];
    }
    int mid = (st + dr) / 2;
    int rez = INT_MIN;
    if(left <= mid) {
        rez = max(rez, query(2*nod, st, mid, left, right));
    }
    if(right > mid) {
        rez = max(rez, query(2*nod+1, mid+1, dr, left, right));
    }
    return rez;
}

int main() {
    int n, q; fin >> n >> q;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
    }
    build(1, 1, n);
    for(int i = 1; i <= q; i++) {
        int op, a, b; fin >> op >> a >> b;
        if(op == 0) {
            fout << query(1, 1, n, a, b) << "\n";
        }
        if(op == 1) {
            update(1, 1, n, a, b);
        }
    }
    return 0;
}