#include <bits/stdc++.h>
using namespace std;

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

int v[100001], s[400001];

void maketree(int i, int p, int q)
{
    if (p == q)
    {
        s[i] = v[p];
    }
    else
    {
        int m = (p + q) / 2;
        maketree(i * 2, p, m);         // avansam pe partea stanga pana ce p devine q
        maketree(i * 2 + 1, m + 1, q); // partea dreapta
        s[i] = max(s[i * 2], s[i * 2 + 1]);
    }
}
long long int suma(int i, int p, int q, int x, int y)
{
    if (x <= p && q <= y)
    {
        return s[i];
    }
    else
    {
        long long val1 = -1, val2 = -1;
        int m = (p + q) / 2;
        if (x <= m)
            val1 = suma(i * 2, p, m, x, y);
        if (m < y)
            val2 = suma(i * 2 + 1, m + 1, q, x, y);
        return max(val1, val2);
    }
}
void update(int i, int p, int q, int x, int y)
{
    if (p == q && p == x)
    {
        s[i] = y;
    }
    else
    {
        int m = (p + q) / 2;
        if (x <= m)
        {
            update(i * 2, p, m, x, y);
        }
        else
        {
            update(i * 2 + 1, m + 1, q, x, y);
        }
        s[i] = max(s[i * 2], s[i * 2 + 1]);
    }
}
int main()
{
    int n, m, a, b, op;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        fin >> v[i];
    }

    maketree(1, 1, n);
    for (int i = 0; i < m; i++)
    {
        fin >> op >> a >> b;
        if (op == 0)
        {
            fout << suma(1, 1, n, a, b) << endl;
        }
        else if (op == 1)
        {
            update(1, 1, n, a, b);
        }
    }
    fin.close();
    fout.close();
    return 0;
}