#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(WHATEVER) for(int i = 1; i <= WHATEVER; ++ i)

/// INPUT / OUTPUT
const string problem = "arbint";
ifstream fin(problem + ".in");
ofstream fout(problem + ".out");

/// GLOBAL VARIABLES
const ll NMAX = 1e5+5, MOD = 1e9 + 7, INF = 1e9;
int n, q, ans;
int arbint[4 * NMAX];

/// SOLUTION
inline void update(int node, int st, int dr, int pos, int val)
{
    if(st == dr)
    {
        arbint[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);
        arbint[node] = max(arbint[node*2], arbint[node*2+1]);
    }
}

inline void query(int node, int st, int dr, int arbst, int arbdr)
{
    if(st > arbdr || dr < arbst)
        return;
    if(st >= arbst && dr <= arbdr)
    {
        ans = max(ans, arbint[node]);
        return;
    }
    int mid = (st + dr) / 2;
    query(node * 2, st, mid, arbst, arbdr);
    query(node * 2 + 1, mid + 1, dr, arbst, arbdr);
}

/// READING THE INPUT
int main()
{
    ios::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    fin >> n >> q;

    for(int i = 1; i <= n; ++ i)
    {
        int a;
        fin >> a;
        update(1, 1, n, i, a);
    }

    while(q--)
    {
        int tip, x, y;
        fin >> tip >> x >> y;
        if(tip == 0)
        {
            ans = 0;
            query(1, 1, n, x, y);
            fout << ans << '\n';
        }
        else
        {
            update(1, 1, n, x, y);
        }
    }
}