#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 1e5+5;
int n, q, ans;
int seg_tree[4*NMAX];

inline void update(int node, int st, int dr, int pos, int val)
{
    if(st == dr)
    {
        seg_tree[node] = val;
    }
    else
    {
        int mid = (st + dr) / 2;
        if(pos <= mid)
            update(node*2, st, mid, pos, val);
        else
            update(node*2+1, mid+1, dr, pos, val);
        seg_tree[node] = max(seg_tree[node*2], seg_tree[node*2+1]);
    }
}

inline void query(int node, int ArbSt, int ArbDr, int st, int dr)
{
    if(ArbDr < st || ArbSt > dr)
        return;
    if(ArbSt >= st && ArbDr <= dr)
    {
        ans = max(seg_tree[node], ans);
        return;
    }
    int ArbMid = (ArbSt + ArbDr) / 2;
    query(node*2, ArbSt, ArbMid, st, dr);
    query(node*2+1, ArbMid+1, ArbDr, st, dr);
}

int main()
{
    fin >> n >> q;
    for(int i = 1; i <= n; ++ i)
    {
        int num;
        fin >> num;
        update(1, 1, n, i, num);
    }
    while(q--)
    {
        bool op;
        int a, b;
        fin >> op >> a >> b;
        if(!op)
        {
            ans = 0;
            query(1, 1, n, a, b);
            fout << ans << '\n';
        }
        else
        {
            update(1,1,n,a,b);
        }
    }
}