#include <iostream>
#include <fstream>
using namespace std;

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

int Segtree[100001], N, v[15001];

void adaugare(long long int nod, long long int poz, long long int left, long long int right){
    if(left > poz || right < poz)
        return;
    if(left == right){
        Segtree[nod] = v[poz];
        return;
    }
    adaugare(nod*2, poz, left, (left+right)/2);
    adaugare(nod*2+1, poz, (left+right)/2+1, right);
    Segtree[nod] = max(Segtree[nod*2], Segtree[nod*2+1]);
}

void modif(long long int nod, long long int left, long long int right,long long int poz, long long int x){
    if(poz < left || poz > right){
            return;
    }
    if(right == left){
        Segtree[nod] = x;
        return;
    }
    modif(nod*2, left, (right+left)/2,poz, x);
    modif(nod*2+1, (right+left)/2+1, right,poz, x);

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

int maxim(int nod, int left, int right, int s, int r){
    if(s > right || left > r)
            //cout<<"acum"<<endl;
            return 0;
    if(s<=left && r>=right)
        return Segtree[nod];
    return max(maxim(nod*2, left, (right+left)/2, s , r) , maxim(nod*2+1, (right+left)/2+1, right, s, r));

}

int main()
{
    int M, poz, val, start, stop, j;
    fin>>N>>M;
    for(int i = 1; i<=N; i++)
        fin>>v[i];
    for(j = 1; j <= N; j++){
        adaugare(1,j,1, N);
    }
//    for(j = 1; j<=2*N-1; j++)
//        cout<<Segtree[j]<<" ";
//    cout<<"\n";
    for(long long int i = 0; i<M; i++){
        long long int op;
        fin>>op;
        if(op==0){
            fin>>poz>>val;
            fout<<maxim(1, 1, N, poz, val)<<"\n";
        }
        else{
            fin>>poz>>val;
            modif(1, 1, N, poz, val);
        }
        }
//    for(j = 1; j<=2*N-1; j++)
//        cout<<Segtree[j]<<" ";

}