#include <iostream>
#include <fstream>

#define ll long long
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");

const int NMax = 1e5 + 5;
const int arbMax = 262144;

int N,M;
int arb[arbMax];

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

int main() {
    /*
    int pw = 1;
    while (pw <= NMax) {
        pw <<= 1;
    }
    pw <<= 1;

    out<<pw<<'\n';
    //*/

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

        update(1,1,N,i,val);
    }

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

        if (tip) {
            update(1,1,N,a,b);
        }
        else {
            out<<query(1,1,N,a,b)<<'\n';
        }
    }

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

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

    int fs = node<<1,ss = fs+1, mij = (st+dr)>>1;

    if (idx <= mij) {
        update(fs,st,mij,idx,val);
    }
    else {
        update(ss,mij+1,dr,idx,val);
    }

    arb[node] = max(arb[fs],arb[ss]);
}

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

    int fs = node<<1,ss = fs+1, mij = (st+dr)>>1, mx = 0;

    if (a <= mij) {
        mx = query(fs,st,mij,a,b);
    }
    if (mij+1 <= b) {
        mx = max(mx,query(ss,mij+1,dr,a,b));
    }

    return mx;
}