#include <bits/stdc++.h>

#define NMAX 100005
using namespace std;


int n, m;
int v[NMAX];
int aint[4 * NMAX];

void build(int node, int st, int dr)
{
    if(st == dr)
    {
        aint[node] = v[st];
        return;
    }

    int mid = (st + dr) / 2;

    build(2 * node, st, mid);
    build(2 * node + 1, mid + 1, dr);

    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

void update(int node, int st, int dr, int pos)
{
    if(st == dr)
    {
        aint[node] = v[st];
        return;
    }

    int mid = (st + dr) / 2;

    if(pos <= mid)
    {
        update(2 * node, st, mid, pos);
    }
    else
    {
        update(2 * node + 1, mid + 1, dr, pos);
    }

    aint[node] = max(aint[2 * node], aint[2 * node + 1]);
}

int query(int node, int st, int dr, int x, int y)
{
    if(dr < x || st > y)
        return 0;
    if(st >= x && dr <= y)
        return aint[node];

    int mid = (st + dr) / 2;

    int Q_st = query(2 * node, st, mid, x, y);
    int Q_dr = query(2 * node + 1, mid + 1, dr, x, y);

    return max(Q_st, Q_dr);
}
int main()
{
    ifstream cin("arbint.in");
    ofstream cout("arbint.out");

    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        cin >> v[i];
    }

    build(1, 1, n);
    for(int i = 1; i <= m; ++i)
    {
        int type;
        cin >> type;

        if(type == 0)
        {
            int x, y;
            cin >> x >> y;
            cout << query(1, 1, n, x, y) << '\n';
        }
        else
        {
            int val, pos;
            cin >> pos >> val;
            v[pos] = val;
            update(1, 1, n, pos);
        }
    }


    return 0;
}