#include <bits/stdc++.h>
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
using namespace std;
int n;
int sg[400005], r ,  x , cs;
int a;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int Query(int v , int lt , int rt , int l , int r){
    if(l > r)return 0;
    if(l == lt && r == rt){
        return sg[v];
    }else{
    int mt = (lt + rt)/2;
     return max(Query(v*2, lt, mt, l, min(r, mt)),Query(v*2+1, mt+1, rt, max(l, mt+1), r));
    }
}
void Update(int v , int lt , int rt , int pos , int val){
    if(lt == rt ){
        sg[v] = val;
    }
    else{
        int mt = (lt + rt)/2;
        if( pos <= mt ){
            Update(2*v,lt,mt,pos,val);
        }
        else{
            Update(2*v+1,mt+1,rt,pos,val);
        }
        sg[v] = max(sg[v*2],sg[v*2+1]);
    }
}
int main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    fin >> n;
    int q;
    fin >> q;
    for(int i = 1 ; i <= n; i++){
        fin >> a;
        Update(1,1,n,i,a);
    }
    for(int i = 1 ; i <= q ;i++){
        fin >> r >> cs >> x;
        if(r == 1){
            Update(1,1,n,cs,x);
        }
        else{
            fout << Query(1,1,n,cs,x) << endl;
        }
    }
}