#include <bits/stdc++.h>
using namespace std;

#define REP(i,a) for (int i = 0; i < a; i++)
#define FOR(i,a,b) for (int i = a; i <= b; i++)
#define ROF(i,a,b) for (int i = a; i >= b; i--)
#define FOREACH(it,x) for (auto it: (x))
#define pb push_back
#define SZ(x) ((int)(x).size())

const int Nmax = 100000;

int data[Nmax*2+5];
int n,m;

void buildTree() {
    for (int p = n - 1; p > 0; p--)
        data[p] = max(data[p<<1],data[p<<1|1]);
}

void update(int pos,int val) {
    data[pos+n] = val;
    for (int p = pos+n; p > 1; p >>= 1)
        data[p>>1] = max(data[p],data[p^1]);
}

int query(int l,int r) {
    int ret = 0;
    for (l += n, r += n + 1; l < r; l>>=1,r>>=1) {
        if (l&1)
            ret = max(ret,data[l++]);
        if (r&1)
            ret = max(ret,data[--r]);
    }
    return ret;
}

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");

    fin >> n >> m;
    REP(i,n) fin >> data[i+n];
    buildTree();
    REP(i,m) {
        int t,a,b; fin >> t >> a >> b;
        if (t == 0) fout << query(a-1,b-1) << "\n";
        else update(a-1,b);
    }
}