#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <algorithm>

using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");

const int NMax = 1e5 + 5;
const int inf = 2e9 + 5;
const int arbMax = 262143 + 5;
typedef long long ll;

int N,M;
int arb[arbMax];

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

int main()
{
    in>>N>>M;
    for (int i=1;i<=N;++i) {
        int val;
        in>>val;
        update(1,1,N,i,val);
    }

    while (M--) {
        int t,a,b;
        in>>t>>a>>b;

        switch(t) {
            case 0: {
                int val = query(1,1,N,a,b);
                out<<val<<'\n';
                break;
            }
            case 1: {
                update(1,1,N,a,b);
                break;
            }
        }
    }

    in.close();out.close();
    return 0;
}

void update(int nod,int st,int dr,int poz,int val) {
    if (st == dr) {
        arb[nod] = val;
        return;
    }

    int mij = (st+dr)>>1;

    if (poz <= mij) {
        update(2*nod,st,mij,poz,val);
    }
    else if (mij+1 <= poz) {
        update(2*nod+1,mij+1,dr,poz,val);
    }
    arb[nod] = max(arb[2*nod],arb[2*nod+1]);
}

int query(int nod,int st,int dr,int a,int b) {
    if (a <= st && dr <= b) {
        return arb[nod];
    }

    int mij = (st+dr)>>1, mx = -1;
    if (a <= mij) {
        mx = query(2*nod,st,mij,a,b);
    }
    if (mij+1 <= b) {
        mx = max(mx, query(2 * nod + 1, mij+1, dr, a, b));
    }
    return mx;
}