#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;
int arr[NMAX];
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 int query(int node, int arbst, int arbdr, int st, int dr)
{
    if(st > arbdr || dr < arbst)
        return 0;
    if(arbst <= st && arbdr >= dr)
        return arbint[node];
    int mid = (st + dr) / 2;
    return max(query(node * 2, arbst, arbdr, st, mid), query(node * 2 + 1, arbst, arbdr, mid + 1, dr));
}

/// 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)
        fin >> arr[i], update(1, 1, n, i, arr[i]);

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