#include <bits/stdc++.h>
#define cin ci
#define cout co
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
const int Nmax = 1e5+1;
int n, m, x, y, c, v[Nmax], tree[4 * Nmax], ans, pos, val, start, fin;
void build(int node, int left, int right)
{
    if(left == right)
    {
        tree[node] = v[left];
        return;
    }
    int mij = (left + right) / 2;
    build(2 * node, left, mij);
    build(2 * node + 1, mij + 1, right);
    tree[node]=  max(tree[2 * node], tree[2 * node + 1]);
}
void update(int node, int left, int right)
{
    if(left == right)
    {
        tree[node] = val;
        return;
    }
    int mij = (left + right) / 2;
    if(pos <= mij)
        update(2 * node, left, mij);
    else
        update(2 * node + 1, mij + 1, right);
    tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
void querry(int node, int left, int right)
{
    if(start <= left && right <= fin)
    {
        ans = max(ans, tree[node]);
        return;
    }
    int mij = (left + right) / 2;
    if(start <= mij)
        querry(2 * node, left, mij);
    if(mij < fin)
        querry(2 * node + 1, mij + 1, right);
}
int main()
{
    cin >> n >> m;
    for(int i=1; i<=n; i++)
        cin >> v[i];
    build(1, 1, n);
    while(m--)
    {
        cin >> c;
        if(c == 1)
        {
            cin >> pos >> val;
            update(1, 1, n);
        }
        else
        {
            cin >> start >> fin;
            ans = 0;
            querry(1, 1, n);
            cout << ans << '\n';
        }
    }
    return 0;
}