#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int n,m,a,b,val,pos,sol;
vector<int> tree;
void update(int x,int left,int right)
{
    if(left==right)
        tree[x]=val;
    else{
        int mid=(left+right)/2;
        if(pos<=mid)
            update(2*x,left,mid);
        else
            update(2*x+1,mid+1,right);
        tree[x]=max(tree[2*x],tree[2*x+1]);
    }
}
void query(int x,int left,int right)
{
    if(a<=left && b>=right)
        sol=max(sol,tree[x]);
    else{
        int mid=(left+right)/2;
        if(a<=mid)
            query(2*x,left,mid);
        if(b>mid)
            query(2*x+1,mid+1,right);
    }
}
int main()
{
    in>>n>>m;
    tree=vector<int> (4*n+1);
    for(pos=1;pos<=n;pos++)
    {
        in>>val;
        update(1,1,n);
    }
    for(;m;m--)
    {
        int t;
        in>>t;
        if(t==0)
        {
            in>>a>>b;
            sol=-INF;
            query(1,1,n);
            out<<sol<<'\n';
        }
        else{
            in>>pos>>val;
            update(1,1,n);
        }
    }
    return 0;
}