#include <bits/stdc++.h>
#define NMAX 100100
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n, m, v[NMAX], tree[4*NMAX], lazy[4*NMAX];
void propag(int node)
{
    lazy[2*node]=lazy[2*node+1]=lazy[node];
    tree[2*node]=tree[2*node+1]=lazy[node];
    lazy[node]=-1;
}
void build(int node, int st, int dr)
{
    if(st==dr)
    {
        lazy[node]=-1;
        tree[node]=v[st];
        return;
    }
    int mij=(st+dr)/2;
    build(2*node, st, mij);
    build(2*node+1, mij+1, dr);
    tree[node]=max(tree[2*node],tree[2*node+1]);
    lazy[node]=-1;
}
void update(int node, int left, int right, int st, int dr, int val)
{
    if(left!=right && lazy[node]!=-1)
        propag(node);
    if(st<=left && right<=dr)
    {
        lazy[node]=val;
        tree[node]=val;
        if(left!=right)
            propag(node);
        return;
    }
    int mij=(left+right)/2;
    if(st<=mij)
        update(2*node, left, mij, st, dr, val);
    if(mij<dr)
        update(2*node+1, mij+1, right, st, dr, val);
    tree[node]=max(tree[2*node], tree[2*node+1]);
//    lazy[node]=min(lazy[2*node], lazy[2*node+1]);
}
int query(int node, int left, int right, int st, int dr)
{
    if(lazy[node]!=-1 && left!=right)
        propag(node);
    if(st<=left && right<=dr)
        return tree[node];
    int mij=(left+right)/2, ans1=-1, ans2=-1;
    if(st<=mij)
        ans1=query(2*node, left, mij, st, dr);
    if(mij<dr)
        ans2=query(2*node+1, mij+1, right, st, dr);
    return max(ans1, ans2);
}
int c, a, b, x;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;++i)
        fin>>v[i];
    build(1, 1, n);

    for(int i=1;i<=m;++i)
    {
        fin>>c>>a>>b;
        if(c==0)
            fout<<query(1, 1, n, a, b)<<'\n';
        else
           update(1, 1, n, a, a, b);
    }

    return 0;
}