#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 100005
int A[(DIM<<2)+66],N,M,i,maxim;
void update(int nod,int st,int dr,int poz,int val)
{
    if (st==dr)
    {
        A[nod]=val;
        return;
    }
    int mid=(st+dr)>>1;
    if (poz<=mid) update(nod<<1,st,mid,poz,val);
    else update((nod<<1)+1,mid+1,dr,poz,val);
    A[nod]=max(A[nod<<1],A[(nod<<1)+1]);
}
void query(int nod,int st,int dr,int a,int b)
{
    if (a<=st && dr<=b)
    {
        maxim=max(maxim,A[nod]);
        return;
    }
    int mid=(st+dr)>>1;
    if (a<=mid) query(nod<<1,st,mid,a,b);
    if (mid<b) query((nod<<1)+1,mid+1,dr,a,b);
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d %d",&N,&M); int x;
    for (i=1;i<=N;i++) scanf("%d",&x),update(1,1,N,i,x);
    while (M--)
    {
        int op,x,y;
        scanf("%d %d %d",&op,&x,&y);
        if (op==1) update(1,1,N,x,y);
        else
        {
            maxim=0;
            query(1,1,N,x,y);
            printf("%d\n",maxim);
        }
    }
    return 0;
}