#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
class ArbInt {
  private:
    vector<int> arbore;
  public:
    ArbInt(vector<int>& numere) {
        arbore.resize(4 * numere.size());
        construire(1, 0, numere.size()-1, numere);
    }
    void construire(int nod, int st, int dr, vector<int> &nr) {
        if(st == dr) {
            arbore[nod] = nr[st];
            return;
        }
        int mij = (st + dr) / 2;
        construire(2 * nod, st, mij, nr);
        construire(2 * nod + 1, mij + 1, dr, nr);

        arbore[nod] = max(arbore[nod * 2], arbore[nod * 2 + 1]);
    }
    int query(int nod, int st, int dr, int start, int finish) {
        if(start<=st && finish>=dr) {
            return arbore[nod];
        }
        int mid = (st + dr) / 2;
        int lquery = -1;
        int rquery = -1;
        if(start<=mid)
            lquery = query(2*nod,st,mid,start,finish);
        if(finish > mid)
            rquery = query(2*nod+1,mid+1,dr,start,finish);
        return max(lquery,rquery);

    }
    void update(int nod, int st, int dr, int val, int poz)
    {
         if(st == dr) {
            arbore[nod] = val;
            return;
        }
        int mij = (st + dr) / 2;
        if(poz <= mij)
        update(2 * nod, st, mij, val,poz);
        else
        update(2 * nod + 1, mij + 1, dr, val,poz);

        arbore[nod] = max(arbore[nod * 2], arbore[nod * 2 + 1]);
    }
    friend ostream & operator <<(ostream &out, const ArbInt&other)
    {
        for(auto&i:other.arbore)
            cout<<i<<" ";
    }
};

int main() {
    int N, M, x,y,z;
    vector<int> A;
    in >> N >> M;
    A.reserve(N);
    for(int i=0; i<N;i++) {
        in >> x;
        A.push_back(x);
    }
    ArbInt H(A);
    while(M--)
    {
        in>>x>>y>>z;
        if(x==0)
            out<<H.query(1,1,N,y,z)<<'\n';
        else
            H.update(1,1,N,z,y);
    }
    return 0;
}