#include <bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int arbore[400070], n, val, pos, maxi;
void update(int nod, int left, int right){
    if(left == right)
    {
        arbore[nod] = val;
        return;
    }
    int div = (left + right)/2;
    if(pos <= div) update(2*nod,left,div);
    else update(2*nod + 1,div + 1,right);
    arbore[nod] = max(arbore[2 * nod],arbore[2 * nod + 1]);
}

void query(int nod,int left,int right, int start, int end){
    if(left == right)
    {
        if(maxi < arbore[nod])
            maxi =arbore[nod];
        return;
    }
    int div = (left + right)/2;
    if(start <= div) query(2*nod, left, div, start, end);
    if(end > div) query(2*nod + 1,div + 1, right, start, end);
}

int main() {
    int m;
    fin >> n >> m;
    for(int i = 1;i <= n;++i)
    {
        fin >> val;
        pos = i;
        update(1,1,n);
    }
    for(int i = 1;i <= m;++i) {
        int op;
        fin >> op>> pos >> val;
        if(op == 0)
        {
           maxi = -1;
           query(1, 1, n, pos ,val);
           fout << maxi << "\n";
        }
        else{
            update(1,1, n);
        }
    }
    return 0;
}