//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#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>
#include <assert.h>

using namespace std;
using ll = long long;

#include <fstream>
//ifstream cin("input.in"); ofstream cout("output.out");
ifstream cin("arbint.in"); ofstream cout("arbint.out");

//VARIABLES

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

//FUNCTIONS

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

    int mid = (st + dr) / 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;
}

void update(int nod, int st, int dr, int pos, int val) {
    if (st == dr) {
        gr[nod] = val;
        return;
    }

    int mid = (st + dr) / 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]);
}

//MAIN

int main() {

    int n, q; cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
        update(1, 1, n, i, v[i]);
    }
    for (int i = 1; i <= q; i++) {
        int tip, a, b;
        cin >> tip >> a >> b;
        if (tip == 0) cout << query(1,1,n,a,b) << '\n';
        else update(1,1,n,a,b);
    }

    return 0;
}