#include <bits/stdc++.h>
#define dim 100001

using namespace std;

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

int n, m;
int tree[4*dim+66];
int start, finish, val, pos, maxim;

void Update(int nod, int left, int right)
{
    if(left==right)
    {
        tree[nod]=val;
        return ;
    }
    int mid=(left+right)/2;
    if(pos<=mid)
        Update(2*nod, left, mid);
    else
        Update(2*nod+1, mid+1, right);
    tree[nod]=max(tree[2*nod], tree[2*nod+1]);
}

void Query(int nod, int left, int right)
{
    if(start<=left && right<=finish)
    {
        if(maxim<tree[nod])
            maxim=tree[nod];
        return ;
    }
    int mid=(left+right)/2;
    if(start<=mid)
        Query(2*nod, left, mid);
    if(mid<finish)
        Query(2*nod+1, mid+1, right);
}

int main()
{
    fin>>n>>m;
    for (int i=1; i<=n; i++)
    {
        int x;
        fin>>x;
        pos=i, val=x;
        Update(1, 1, n);
    }
    for (int i=1; i<=m; i++)
    {
        int x, a, b;
        fin>>x>>a>>b;
        if(x==0)
        {
            maxim=-1;
            start=a, finish=b;
            Query(1, 1, n);
            fout<<maxim<<'\n';
        }
        else
        {
            pos=a, val=b;
            Update(1, 1, n);
        }
    }
    return 0;
}