#include <bits/stdc++.h>
#define NMAX 100005

using namespace std;

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

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

void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr){
        AINT[nod] = val;
        return;
    }

    int mid = (st + dr) / 2;
    if(pos <= mid) update(nod * 2, st, mid, pos, val);
    else update(nod * 2 + 1, mid + 1, dr, pos, val);

    AINT[nod] = max(AINT[nod * 2], AINT[nod * 2 + 1]);
}

int query(int nod, int st, int dr, int L, int R)
{
    if(L <= st and dr <= R){
        return AINT[nod];
    }

    int a = 0, b = 0;
    int mid = (st + dr) / 2;
    if(L <= mid){
        a = query(nod * 2, st, mid, L, R);
    }
    if(R > mid) b = query(nod * 2 + 1, mid + 1, dr, L, R);

    return max(a, b);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
        update(1, 1, n, i, v[i]);
    }
    for (int i = 1; i <= m; i++){
        int x, a, b;
        fin >> x >> a >> b;
        if(x == 1)
            update(1, 1, n, a, b);
        else fout << query(1, 1, n, a, b) << '\n';
    }

    return 0;
}