#include <iostream>
#include <fstream>
#include <climits>
#include <algorithm>
using namespace std;
const int MAXN = 100000;
int arbore[4*MAXN];

void build(int a[], int v, int capatSt, int capatDr) {
    if (capatSt == capatDr) {
        arbore[v] = a[capatSt];
    } else {
        int mij = (capatSt + capatDr) / 2;
        build(a, v*2, capatSt, mij);
        build(a, v*2+1, mij+1, capatDr);
        arbore[v] = max(arbore[v*2], arbore[v*2+1]);
    }
}

void update(int v, int capatSt, int capatDr, int pozitie, int valoare_noua) {
    if (capatSt == capatDr) {
        arbore[v] = valoare_noua;
    } else {
        int mij = (capatSt + capatDr) / 2;
        if (pozitie <= mij)
            update(v*2, capatSt, mij, pozitie, valoare_noua);
        else
            update(v*2+1, mij+1, capatDr, pozitie, valoare_noua);
        arbore[v] = max(arbore[v*2], arbore[v*2+1]);
    }
}

void query(int v, int capatSt, int capatDr, int st, int dr, int& maxx) {
    if(st > dr) return;
    if (st <= capatSt && capatDr <= dr) {
        maxx = max(maxx, arbore[v]);
        return;
    }
    int mij = (capatSt + capatDr) / 2;
    query(v*2, capatSt, mij, st, min(dr, mij), maxx);
    query(v*2+1, mij+1, capatDr, max(st, mij+1), dr, maxx);
}

int main() {
    ifstream fin("input.txt");
    ofstream fout("output.txt");

    int N, M;
    fin >> N >> M;
    int A[N];
    for(int i = 0; i < N; i++) {
        fin >> A[i];
    }
    build(A, 1, 0, N-1);
    for(int i = 0; i < M; i++) {
        int op, a, b;
        fin >> op >> a >> b;
        a--; // 0-indexing
        if(op == 0) {
            int max_val = INT_MIN;
            query(1, 0, N-1, a, b-1, max_val);
            fout << max_val << "\n";
        } else if(op == 1) {
            update(1, 0, N-1, a, b);
        }
    }

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