#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int m, n;
int arborebinar[400100];
int start, finish;
int maxim;
void Update(int nod, int stanga, int dreapta, int val, int pos){
if (stanga == dreapta){
arborebinar[nod] = val;
return;
}
int div = (dreapta+stanga)/2;
if (div >= pos) Update(2*nod,stanga,div,val, pos);
else Update(2*nod+1,div+1,dreapta,val, pos);
arborebinar[nod] = max(arborebinar[2*nod + 1], arborebinar[2*nod]);
}
void Query(int nod, int stanga, int dreapta, int start, int finish){
if ((stanga >= start) && (dreapta <= finish))
{
maxim = max(arborebinar[nod], maxim);
return;
}
int div = (stanga+dreapta) / 2;
if (start <= div) Query(2*nod, stanga, div, start, finish);
if (finish > div) Query(2*nod + 1,div + 1, dreapta, start, finish);
}
int main()
{
int x, a, b;
fin>>n>>m;
for (int i = 1; i <= n; i++){
fin>>x;
Update(1,1,n, x, i);
}
for (int i = 1; i <= m; i++){
fin>>x>>a>>b;
if (x == 0){
maxim = -1;
Query(1,1,n, a, b);
fout<<maxim<<"\n";
}
else{
Update(1,1,n,b, a);
}
}
return 0;
}