#include <fstream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

const int NMAX = 100000 + 5;
int n;
int N, M;
int v[NMAX];


void op0(int a, int b)
{
    vector < int > cop(b-a+1);

    copy(v+a-1,v + b, cop.begin());

    sort(cop.begin(), cop.end());

    fout << cop[cop.size()-1]<<endl;
}

int main()
{

    fin >> N >> M;
    int k, a, b, op;

    for (int i = 0; i < N; ++i)
    {
        fin >> v[i];
    }
    for (int i=1; i<=M; ++i)
    {
        fin >> op >> a >> b;

        if (op == 0)op0(a, b);
        else v[a-1] = b;
    }

       return 0;
}