#include <bits/stdc++.h>
#define pii pair<int, int>
#define ff first
#define ss second
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define eb emplace_back


using namespace std;
const string TASK("arbint");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout

const int N = 1e5 + 9;

int n, m, a[N];

int tree[4 * N];
void Build(int nod = 1, int st = 1, int dr = n)
{
    if(st == dr)
    {
        tree[nod] = a[st];
        return;
    }
    int m = (st + dr) >> 1;
    Build(nod << 1, st, m);
    Build(nod << 1 | 1, m + 1, dr);
    tree[nod] = max(tree[nod << 1], tree[nod << 1 | 1]);
}

void Update(int poz, int val, int nod = 1, int st = 1, int dr = n)
{
    if(st == dr)
    {
        tree[nod] = val;
        return;
    }
    int m = (st + dr) >> 1;
    if(poz <= m)Update(poz, val, nod << 1, st, m);
    else Update(poz, val, nod << 1 | 1, m + 1, dr);
    tree[nod] = max(tree[nod << 1], tree[nod << 1 | 1]);
}

int Query(int l, int r, int nod = 1, int st = 1, int dr = n)
{
    if(l <= st && dr <= r)return tree[nod];
    int m = (st + dr) >> 1;
    if(r <= m)return Query(l, r, nod << 1, st, m);
    else if(l > m)return Query(l, r, nod << 1 | 1, m + 1, dr);
    return max(Query(l, r, nod << 1, st, m), Query(l, r, nod << 1 | 1, m + 1, dr));
}

int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    cin >> n >> m;
    for(int i = 1; i <= n; ++i)cin >> a[i];

    Build();

    int op, x, y;
    for(int i = 1; i <= m; ++i)
    {
        cin >> op >> x >> y;
        if(op == 0)cout << Query(x, y) << '\n';
        else Update(x, y);
    }
    return 0;
}