#include <fstream>
#include <cstring>
#include <algorithm>
#include <climits>
using namespace std;

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

const int MAXN = 100005;
int n, m;
int v[MAXN * 10];
int a[MAXN];

void calc(int node) {
    v[node] = max(v[node * 2], v[node * 2 + 1]);
}

void build(int node, int l, int r) {
    if (l == r) {
        v[node] = a[l];
    }
    else {
        int mid = (l + r) / 2;
        build(node * 2, l, mid);
        build(node * 2 + 1, mid + 1, r);
        calc(node);
    }
}

void update(int node, int l, int r, int poz, int val) {
    if (l == r) {
        v[node] = val;
    }
    else {
        int mid = (l + r) / 2;
        if (poz <= mid) {
            update(2 * node, l, mid, poz, val);
        }
        else {
            update(2 * node + 1, mid + 1, r, poz, val);
        }
        calc(node);
    }
}

int query(int node, int l, int r, int st, int dr) {
    if (st <= l && r <= dr) {
        return v[node];
    }
    else {
        int ans = INT_MIN;
        int mid = (l + r) / 2;
        if (st <= mid) {
            ans = max(ans, query(node * 2, l, mid, st, dr));
        }
        if (dr >= mid + 1) {
            ans = max(ans, query(node * 2 + 1, mid + 1, r, st, dr));
        }
        return ans;
    }
}


int main() {

    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> a[i];
    }

    build(1, 1, n);

    for (int i = 1; i <= m; ++i) {
        int cer, x, y;
        fin >> cer >> x >> y;
        if (cer == 0) {
            fout << query(1, 1, n, x, y) << '\n';
        }
        else {
            update(1, 1, n, x, y);
        }
    }


    fout.close();
    return 0;
}