#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int A[500000];
void update(int node, int left, int right, int poz, int val)
{
    if(left==right)
    {
        A[node]=val;
        return;
    }
    int mid=(left+right)/2;
    if(poz<=mid)
        update(2*node, left, mid, poz, val);
    else update(2*node+1, mid+1, right, poz, val);
    A[node]=max(A[2*node], A[2*node+1]);
}

int query(int node, int left, int right, int a, int b)
{
    if(a<=left && right<=b)
        return A[node];
    int v1=0, v2=0;
    int mid=(left+right)/2;
    if(a<=mid)
        v1=query(2*node, left, mid, a, b);
    if(b>mid)
        v2=query(2*node+1, mid+1, right, a, b);
    return max(v1, v2);
}

int main()
{int n, m, x, i, op, a, b;
    fin>>n>>m;
    for(i=1;i<=n;++i)
    {
        fin>>x;
        update(1, 1, n, i, x);
    }
    for(i=1;i<=m;++i)
    {
        fin>>op>>a>>b;
        if(op==0)
            fout<<query(1, 1, n, a, b)<<endl;
        else if(op==1)
            update(1, 1, n, a, b);
    }
    return 0;
}