#include <fstream>
//#include <iostream>
#include <deque>
#include <set>
#include <climits>
using namespace std;

ifstream cin("arbint.in");
ofstream cout("arbint.out");

const int NMAX = 100003;
int v[NMAX], tree[2 * NMAX];
void build(int node, int st, int dr)
{
    if (st == dr)
    {
        tree[node] = v[st];
        return ;
    }
    build(2 * node, st, (st + dr) / 2);
    build(2 * node + 1, (st + dr) / 2 + 1, dr);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}

void update(int node, int pos, int val, int st, int dr)
{
    if (st == dr)
    {
        tree[node] = val;
        return ;
    }
    int med = (st + dr) / 2;
    if (pos <= med)
        update(2 * node, pos, val, st, med);
    else
        update(2 * node + 1, pos, val, med + 1, dr);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
int query(int node, int st, int dr, int x, int y)
{
    if (st == x and dr == y)
        return tree[node];
    int med = (st + dr) / 2;
    if (y <= med)
        return query(2 * node, st, med, x, y);
    if (x > med)
        return query(2 * node + 1, med + 1, dr, x, y);
    return max(query(2 * node, st, med, x, med),
               query(2 * node + 1, med + 1, dr, med + 1, y)
               );
}
int main()
{
    int n, m, i;
    cin >> n >> m;
    for (i = 1; i <= n; i++)
        cin >> v[i];
    build(1, 1, n);
    while (m--)
    {
        int op, a, b;
        cin >> op >> a >> b;
        if (op == 1)
            update(1, a, b, 1, n);
        else cout << query(1, 1, n, a, b) << "\n";
    }
    return 0;
}