#include <fstream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;

ifstream cin ("arbint.in");
ofstream cout ("arbint.out");

const int MAXN=100000;
int tree[4*MAXN+5];
int a[MAXN+5];

void build(int node,int st,int dr) {
    if (st==dr) {
        tree[node]=a[st];
        return;
    }
    int mid=(st+dr)/2;
    build(2*node,st,mid);
    build(2*node+1,mid+1,dr);
    tree[node]=max(tree[2*node],tree[2*node+1]);
}

void update(int node,int st,int dr,int pos,int val) {
    if (st==dr) {
        tree[node]=val;
        return;
    }
    int mid=(st+dr)/2;
    if (pos<=mid) {
        update(2*node,st,mid,pos,val);
    } else {
        update(2*node+1,mid+1,dr,pos,val);
    }
    tree[node]=max(tree[2*node],tree[2*node+1]);
}

int query(int node,int st,int dr,int l,int r) {
    if (l<=st && dr<=r) {
        return tree[node];
    }
    int mid=(st+dr)/2;
    int max_left=0,max_right=0;
    if (l<=mid) {
        max_left=query(2*node,st,mid,l,r);
    }
    if (r>mid) {
        max_right=query(2*node+1,mid+1,dr,l,r);
    }
    return max(max_left,max_right);
}

signed main() {
    int n,m;
    cin>>n>>m;
    for (int i=1; i<=n; i++) {
        cin>>a[i];
    }
    build(1,1,n);
    for (int i=0; i<m; i++) {
        int type,x,y;
        cin>>type>>x>>y;
        if (type==0) {
            cout<<query(1,1,n,x,y)<<"\n";
        } else {
            update(1,1,n,x,y);
        }
    }
}