#include <bits/stdc++.h>
#define NMAX 100500
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int tree[4*NMAX+10],v[NMAX];
void build(int node, int left,int right)
{
    if(left==right)
    {
        tree[node]=v[left];
        return;
    }
    int mij=(left+right)/2;
    build(2*node, left, mij);
    build(2*node+1, mij+1, right);
    tree[node]=max(tree[2*node], tree[2*node+1]);
}
int query(int node, int left, int right, int st, int dr)
{
    if(st<=left && right<=dr)
        return tree[node];
    int mij=(left+right)/2,ans1=-1,ans2=-1;
    if(st<=mij)
        ans1=query(2*node, left, mij, st, dr);
    if(mij<dr)
        ans2=query(2*node+1,mij+1,right, st,dr);
    return max(ans1, ans2);
}
void update(int node, int left, int right, int poz, int val)
{
    if(left==right)
    {
        tree[node]=val;
        return;
    }
    int mij=(left+right)/2;
    if(poz<=mij)
        update(2*node, left,mij, poz, val);
    else update(2*node+1, mij+1, right, poz,val);

    tree[node]=max(tree[2*node], tree[2*node+1]);
}
int n, m, c,a,b;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;++i)
        fin>>v[i];
    build(1,1,n);
    for(int i=1;i<=m;++i)
    {
        fin>>c>>a>>b;
        if(c==0)
            fout<<query(1,1,n,a,b)<<'\n';
        else
            update(1,1,n,a,b);
    }

    return 0;
}