//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>

using namespace std;

//#include <iostream>
#include <fstream>
//ifstream fin("input.in"); ofstream fout("output.out");
ifstream fin("arbint.in"); ofstream fout("arbint.out");

//VARIABLES

int v[100005];
int gr[400005];

//FUNCTIONS

void query() {
    
}

void update(int nod, int st, int dr, int pos, int val) {

    if (st == dr) {
        gr[nod] = val;
        return;
    }

    int mid = st + dr;
    mid /= 2;
    if (pos <= mid) update(nod * 2, st, mid, pos, val);
    else update(nod * 2 + 1, mid + 1, dr, pos, val);


    gr[nod] = max(gr[nod * 2], gr[nod * 2 + 1]);

}

int query(int nod, int st, int dr, int ST, int DR) {
    if (st >= ST && dr <= DR) return gr[nod];
    
    int mid = st + dr;
    mid /= 2;

    int MAX = 0;
    if (ST <= mid) MAX = max(MAX, query(nod * 2, st, mid, ST, DR));
    if (mid < DR) MAX = max(MAX, query(nod * 2 + 1, mid + 1, dr, ST, DR));

    return MAX;
}

//MAIN
int main() {

    int n, m;

    fin >> n >> m;

    for (int i = 1; i <= n; i++) {
        fin >> v[i];
        update(1, 1, n, i, v[i]);
    }

    for (int i = 1; i <= m; i++) {
        int t, a, b;
        fin >> t >> a >> b;
        if (t == 1) update(1, 1, n, a, b);
        else fout << query(1, 1, n, a, b) << '\n';
    }

    return 0;
}