#include <bits/stdc++.h>
#define fast ios_base :: sync_with_stdio(0); cin.tie(0);
#pragma GCC optimize("O3")
#define FILE_NAME "arbint"
#define NMAX 100000 + 100
#define vs nod<<1
#define vd nod<<1|1
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> llp;
typedef pair<ld,ld> pct;

const ll inf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;

ifstream f(FILE_NAME".in");
ofstream g(FILE_NAME".out");

inline void add(ll &a , ll b)
{
    a += b;
    a %= mod;
}

inline void sub(ll &a, ll b)
{
    a = (a - b + mod) % mod;
}
int aint[4 * NMAX], v[NMAX], n, q, poz, val, L, R, ans;

void build(int nod, int st, int dr)
{
    if(st == dr)
    {
        aint[nod] = v[st];
        return;
    }
    int mid = (st + dr) / 2;
    build(vs, st, mid);
    build(vd, mid + 1, dr);
    aint[nod] = max(aint[vs], aint[vd]);
}

void update(int nod, int st, int dr)
{
    if(st == dr)
    {
        aint[nod] = val;
        return;
    }
    int mid = (st + dr) / 2;
    if(poz <= mid)
        update(vs, st, mid);
    else
        update(vd, mid + 1, dr);
    aint[nod] = max(aint[vs], aint[vd]);
}

void query(int nod, int st, int dr)
{
    if(L <= st && dr <= R)
    {
        ans = max(ans, aint[nod]);
        return;
    }
    int mid = (st + dr) / 2;
    if(L <= mid)
        query(vs, st, mid);
    if(R > mid)
        query(vd, mid + 1, dr);
}
int main()
{
    f >> n >> q;
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    build(1,1,n);
    while(q--)
    {
        int t;
        f >> t;
        if(t == 0)
        {
            f >> L >> R;
            ans = 0;
            query(1,1,n);
            g << ans << '\n';
        }
        else
        {
            f >> poz >> val;
            update(1,1,n);
        }
    }
    f.close();
    g.close();
    return 0;
}