#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
const long long INFLL = (1LL<<62);
const int INFINT = 2000000000;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*template <typename T>
string to_string(const T& n){
    ostringstream os;
    os << n;
    return os.str();
}
*/

/*struct coord
{
    int x,y;

};
bool operator<(const coord &l, const coord &r)
{
    return (l.x<r.x || (l.x==r.x && l.y<r.y));
}*/

/*void invers_modular(int a, int b, int& d, int& x, int & y)
{
    if(!b)
    {
        d=a;
        x=1;
        y=0;
        return ;
    }2
    int x0, y0;
    invers_modular(b, a%b, d, x0, y0);
    x=y0;
    y=x0-a/b*y0;
} // daca x<0 se aduna cu mod pana e mai mare, x fiind rezultatul*/

/*ull p(int baze, int exponent)
{
    if(exponent==0)
        return 1;

    if(exponent%2==0)
        return p(baze*baze, exponent/2);
    else return baze*p(baze, exponent-1);
}*/
ifstream fin("arbint.in"); /// modifica cu numele corespunzator
ofstream fout("arbint.out"); /// modifica cu numele corespunzator
int n, m;
int arbore[200001+66];

int val, pos;
void update(int,int,int);

int mmax, start, finish;
void interogation(int,int,int);

int main()
{

    fin>>n>>m;
    for1(i, n)
    {
        fin>>val;
        pos = i;
        update(1, 1, n);
    }
    for1(nrquery, m)
    {
        int q;
        fin>>q;
        if(q)
        {
            fin>>pos>>val;
            update(1, 1, n);
        }
        else
        {
            mmax = -1;
            fin>>start>>finish;
            interogation(1, 1, n);
            fout<<mmax<<'\n';
        }
    }

    return 0;
}

void update(int nod, int l, int r)
{
    if(l == r)
    {
        arbore[nod] = val;
        return;
    }

    int mid = (l + r) / 2;
    if(pos <= mid) update(2*nod, l, mid);
    else update(2*nod + 1, mid + 1, r);

    arbore[nod] = max(arbore[2*nod], arbore[2*nod + 1]);
}

void interogation(int nod, int l, int r)
{
    if(start <= l && finish >= r)
    {
        mmax = max(mmax, arbore[nod]);
        return ;
    }

    int mid = (l + r) / 2;
    if(start <= mid) interogation(2*nod, l, mid);
    if(finish > mid) interogation(2*nod + 1, mid + 1, r);
}