#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
const int NMax = 100000, oo = 1e9;

int N, M, AIT[4*NMax];

void Update(int i, int low, int hi, int pos, int val) {
    if (pos < low || pos > hi)
        return;
    if (low == hi) {
        AIT[i] = val; return;
    }

    int mid = (low + hi) / 2;

    Update(2*i,low,mid,pos,val);
    Update(2*i+1,mid+1,hi,pos,val);

    AIT[i] = max(AIT[2*i], AIT[2*i+1]);
}

int Querry(int i, int low, int hi, int a, int b) {
    if (b < low || a > hi)
        return -oo;
    if (a <= low && hi <= b)
        return AIT[i];
    int mid = (low + hi)/2;
    return max(Querry(2*i,low,mid,a,b), Querry(2*i+1,mid+1,hi,a,b));
}

int main() {
    in >> N >> M;

    for (int i = 1,x; i <= N; i++) {
        in >> x;
        Update(1,1,N,i,x);
    }
    for (int j = 0; j < M; j++) {
        int t,a,b;
        in >> t >> a >> b;
        if (!t)
            out << Querry(1,1,N,a,b) << '\n';
        if (t)
            Update(1,1,N,a,b);
    }
}