#include <bits/stdc++.h>

using namespace std;

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

const int N = 1e5 + 5;

int v[N], tree[4 * N], n;

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

void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr)
    {
        tree[nod] = val;
        return;
    }
    int med = (st + dr) / 2;
    if(pos <= med)
        update(2 * nod, st, med, pos, val);
    else
        update(2 * nod + 1, med + 1, dr, pos, val);
    tree[nod] = max(tree[2 * nod], tree[2 * nod + 1]);
}

int query(int nod, int st, int dr, int a, int b)
{
    if(a <= st && dr <= b)
    {
        return tree[nod];
    }
    else
    {
        int med = (st + dr) / 2;
        int lft = 0, rght = 0;
        if(a <= med)
        {
            lft = query(2 * nod, st, med, a, b);
        }
        if(b >= med + 1)
        {
            rght = query(2 * nod + 1, med + 1, dr, a, b);
        }
        return max(lft, rght);
    }
}

int main()
{
    int q;
    in >> n >> q;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    build(1, 1, n);
    while(q--)
    {
        int op, a, b;
        in >> op >> a >> b;
        if(op == 1)
        {
            update(1, 1, n, a, b);
        }
        else {
            out << query(1, 1, n, a, b) << '\n';
        }
    }
    return 0;
}