//#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <set>
#include <algorithm>
#include <bitset>
#include <time.h>
#include <tuple>
#include <fstream>
#include <iomanip>
#include <utility>
#include <list>

#pragma warning "da 100% din tine. :) chiar?"
#define nl '\n'
#define cnl cout << '\n';
#define pb(x) push_back(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ll long long
#define ull unsigned ll
#ifdef INFOARENA
#define ProblemName "arbint"
#endif
#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "a.in"
#define OuFile "a.out"
#endif

using namespace std;
ifstream cin(InFile);
ofstream cout(OuFile);

template<class v, class type>
void print(v Vector, type nr) {
    for_each(all(Vector), [](type x) {
        cout << x << ' ';
    });
}

int n,m;
const int dim = 100001;
int marb[4*dim + 50];

int start,finish,val,pos,maxim;

inline int operatie(int a, int b){
    if(a > b) return a;
    return b;
}

void update(int,int,int);
void query(int,int,int);

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    clock_t tStart = clock();

    cin >> n >> m;
    int x;
    for(int i = 1; i<=n; ++i){
        cin >> x;
        pos = i;
        val = x;
        update(1,1,n);
    }

    int a,b;
    for(int i = 0; i<m; ++i){
        cin >> x >> a >> b;
        if(x == 0){
            maxim = -1;
            start = a;
            finish = b;
            query(1,1,n);

            cout << maxim << nl;
        }

        else {
            pos = a;
            val = b;
            update(1,1,n);
        }
    }
    printf("\nTime taken: %.2fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
}

void update(int nod, int left, int right){
    if(left == right){
        marb[nod] = val;
        return;
    }

    int div = (left + right)/2;
    if(pos <= div) update(2*nod, left, div);
    else update(2*nod+1, div+1, right);

    marb[nod] = operatie(marb[2*nod], marb[2*nod + 1]);
}

void query(int nod, int left, int right){
    if(start <= left && right <= finish){
        if(maxim < marb[nod]) maxim = marb[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);
}