#include <iostream>
#include <fstream>

using namespace std;

const int Nmax = 100005;

int n, m, v[Nmax], aint[4*Nmax];

void Build(int nod, int st, int dr){
    if(st == dr){
        aint[nod] = v[st];
        return;
    }
    int mid = (st + dr) / 2;
    Build(2*nod, st, mid);
    Build(2*nod+1, mid+1, dr);
    aint[nod] = max(aint[2*nod], aint[2*nod+1]);
}

void Update(int nod, int st, int dr, int a, int b){
    if(st == dr){
        aint[nod] = b;
        return;
    }
    int mid = (st + dr) / 2;
    if(a <= mid){
        Update(2*nod, st, mid, a, b);
    }
    else{
        Update(2*nod+1, mid+1, dr, a, b);
    }
    aint[nod] = max(aint[2*nod], aint[2*nod+1]);
}

int Query(int nod, int st, int dr, int a, int b){
    if(st == a && dr == b){
        return aint[nod];
    }
    int mid = (st + dr) / 2;
    if(b <= mid){
        return Query(2*nod, st, mid, a, b);
    }
    else{
        if(a > mid){
            return Query(2*nod+1, mid+1, dr, a, b);
        }
        else{
            return max(Query(2*nod, st, mid, a, mid), Query(2*nod+1, mid+1, dr, mid+1, b));
        }
    }
}

int main()
{
    ifstream fin("arbint.in");
    ofstream fout("arbint.out");
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
    }
    Build(1, 1, n);
    while(m--){
        int opp, a, b;
        fin >> opp >> a >> b;
        if(opp == 1){
            Update(1, 1, n, a, b);
        }
        else{
            fout << Query(1, 1, n, a, b) << "\n";
        }
    }

    return 0;
}