#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

#define nmax 100010
#define leftSon (node << 1)
#define rightSon ((node << 1) + 1)

int Aint[8 * nmax], N, M, A, B, C, X, pos, val, leftRange, rightRange, ans;

void Update(int node, int left, int right)
{
     if(left == right)
     {
             Aint[node] = val;
             return ;
     }
     int mid = (left + right) >> 1;
     if(pos <= mid) Update(leftSon, left, mid);
     else Update(rightSon, mid + 1, right);
     Aint[node] = max(Aint[leftSon], Aint[rightSon]);
}

void Query(int node, int left, int right)
{
     if(leftRange <= left && right <= rightRange)
     {
             ans = max(ans, Aint[node]);
             return ;
     } 
     int mid = (left + right) >> 1;
     if(leftRange <= mid) Query(leftSon, left, mid);
     if(mid < rightRange) Query(rightSon, mid + 1, right);
}

int main()
{
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
    int i;
    scanf("%i %i", &N, &M);
    for(i = 1; i <= N; i++)
    {
          scanf("%i", &X);
          pos = i; val = X;
          Update(1, 1, N);
    }
    for(; M; M --)
    {
          scanf("%i %i %i", &C, &A, &B);
          if(C == 0)
          {
               leftRange = A, rightRange = B;
               ans = 0;
               Query(1, 1, N);
               printf("%i\n", ans);
          }else
          {
               pos = A;
               val = B;
               Update(1, 1, N);
          }
    }
    return 0;
}