#include <bits/stdc++.h>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
const int NMAX = 100005;
int n, m, x, a, b, val, pos, maxim, start, finish;
int maxarb[4*NMAX];
void Update(int nod, int left, int right)
{
    if (left == right){
        maxarb[nod] = val;
        return;
    }
    int div = (left + right)/2;
    if (pos <= div){
        Update(2*nod, left, div);
    }else{
        Update(2*nod+1, div+1, right);
    }
    maxarb[nod] = max(maxarb[2*nod], maxarb[2*nod+1]);
}
void Query(int nod, int left, int right)
{
    if (start <= left && right <= finish)
    {
        if (maxim < maxarb[nod])
            maxim = maxarb[nod];
        return;
    }
    int div = (left + right)/2;
    if (start <= div) Query(2*nod, left, div);
    if (div < finish) Query(2*nod+1, div+1, right);
}
int main()
{
    fin >> n >> m;
    for (int i=1;i<=n;i++){
        fin >> val;
        pos = i;
        Update(1, 1, n);
    }
    while(m --){
        fin >> x >> a >> b;
        if (x == 0){
            maxim = 0;
            start = a, finish = b;
            Query(1, 1, n);
            fout << maxim << '\n';
        }else{
            pos = a, val = b;
            Update(1, 1, n);
        }
    }
}