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

ifstream f("arbint.in");
ofstream g("arbint.out");

int n, m, queryAnswer;
vector <int> v, aint;

void init() {
    v = vector <int> (n + 1);
    aint = vector <int> (4 * n + 1);
}

void build(int node, int left, int right) {
    if(left == right) {
        aint[node] = v[left];
        return;
    }
    int mid = (left + right) / 2;
    build(2 * node, left, mid);
    build(2 * node + 1, mid + 1, right);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void update(int node, int left, int right, const int& pos, const int& val) {
    if(left == right) {
        aint[node] = val;
        return;
    }
    int mid = (left + right) / 2;
    if(pos <= mid)
        update(2 * node, left, mid, pos, val);
    else update(2 * node + 1, mid + 1, right, pos, val);
    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void query(int node, int left, int right, const int& queryLeft, const int& queryRight) {
    if(queryLeft <= left && right <= queryRight) {
        queryAnswer = max(queryAnswer, aint[node]);
        return;
    }
    int mid = (left + right) / 2;
    if(queryLeft <= mid)
        query(2 * node, left, mid, queryLeft, queryRight);
    if(mid < queryRight)
        query(2 * node + 1, mid + 1, right, queryLeft, queryRight);
}

void read() {
    f >> n >> m;
    init();
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    build(1, 1, n);
    int c, x, y;
    for(int i = 1; i <= m; ++i) {
        f >> c >> x >> y;
        if(c == 1)
            update(1, 1, n, x, y);
        else {
            queryAnswer = -2e9;
            query(1, 1, n, x, y);
            g << queryAnswer << "\n";
        }
    }
}

int main()
{
    read();
}