#include <iostream>
#include <fstream>
using namespace std;

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

int n, m, v[100005], i, x , y, sol;
int MaxArb[200005];

void build(int, int, int);
void update(int, int, int, int, int);
void query(int, int, int, int, int);


int main() {

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

    // Perform operations
    for ( i = 1; i <= m; ++i) {
        int o, a, b;
        fin >> o >> x >> y;
        if (o == 0) {
            sol = -1000000000;
            query(1, 1, n, x, y);
            fout << sol << "\n";
        } else {
            update(1, 1, n, x, y);
        }
    }

    return 0;
}


void query(int n, int start, int end, int l, int r) {
    //if (r < start || l > end) return;
    if (l <= start && r >= end)
    {
        sol = max(sol, MaxArb[n]);
        return;
    }

    int mij = (start + end) / 2;
    int m1 = 0, m2 = 0;
    if(l <= mij)
        query(n * 2, start, mij, l, r);
    if(mij < r)
        query(n * 2 + 1, mij + 1, end, l, r);
}

void update(int n, int start, int end, int idx, int val) {
    if (start == end) {
        v[idx] = val;
        MaxArb[n] = val;
        return;
    }

    int mid = (start + end) / 2;
    if (idx <= mid) {
        update(n * 2, start, mid, idx, val);
    } else {
        update(n * 2 + 1, mid + 1, end, idx, val);
    }

    MaxArb[n] = max(MaxArb[n * 2], MaxArb[n * 2 + 1]);
}

void build(int n, int start, int end) {
    if (start == end) {
        MaxArb[n] = v[end];
        return;
    }

    int mid = (start + end) / 2;
    build(n * 2, start, mid);
    build(n * 2 + 1, mid + 1, end);
    MaxArb[n] = max(MaxArb[n * 2], MaxArb[n * 2 + 1]);
}