#include <iostream>
#include <fstream>

using namespace std;

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

#define NMAX 100001
#define INF 1000000001;

int t[4*NMAX];

void constructie(int p, int st, int dr){
    if(st == dr){
        fin >> t[p];
        return;
    }
    int m = (st + dr)/2;
    int fs = 2*p;
    int fd = 2*p + 1;
    constructie(fs, st, m);
    constructie(fd, m + 1, dr);
    t[p] = max(t[fs], t[fd]);
}

void actualizare(int p, int st, int dr, int poz, int val){
    if(st == dr){
        t[p] = val;
        return;
    }
    int m = (st + dr) / 2;
    int fs = 2*p;
    int fd = 2*p + 1;
    if(poz <= m){
        actualizare(fs, st, m, poz, val);
    }else{
        actualizare(fd, m + 1, dr, poz, val);
    }
    t[p] = max(t[fs], t[fd]);
}

int interogare(int p, int st, int dr, int a, int b){
    if(a <= st && dr <= b){
        return t[p];
    }
    int m = (st + dr) / 2, fs = 2 * p, fd = 2 * p + 1;
    int rez_st = -INF;
    int rez_dr = -INF;
    if(a <= m){
        rez_st = interogare(fs, st, m, a, b);
    }
    if(m + 1 <= b){
        rez_dr = interogare(fd, m + 1, dr, a, b);
    }
    return max(rez_st, rez_dr);
}

int main()
{
    int n, m;

    fin >> n >> m;

    constructie(1, 1, n);
    for(int i = 0; i < m; i++){
        int tip;
        fin >> tip;
        int a, b;
        fin >> a >> b;
        if(tip == 0){
            fout << interogare(1, 1, n, a, b) << "\n";
        }else{
            actualizare(1, 1, n, a, b);
        }
    }

    fin.close();
    fout.close();
    return 0;
}