#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define pi pair <int, int>
#define sz(x) (int)((x).size())
#define make_unique(v) v.erase(unique(all(v)),v.end())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 0x3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
const int N = 2e5 + 11;

int n,a[N],t[4*N],m;

void build(int v,int l,int r){
    if(l==r){
        t[v] = a[l];
    }else{
        int mid = (l+r)/2;
        build(2*v,l,mid);
        build(2*v+1,mid+1,r);
        t[v] = max(t[2*v],t[2*v+1]);
    }
}

int get(int v,int tl,int tr,int l,int r){

    if(tl <= l && r <= tr)return t[v];
    int mid = (l+r)/2;
    return max(((tl <= mid) ? get(2*v,tl,tr,l,mid) : 0),((tr > mid) ? get(2*v+1,tl,tr,mid+1,r) : 0));
}

void update(int v,int l,int r,int pos, int val){

    if(l==r){
        t[v] = val;
        return;
    }
    int mid = (l+r)/2;
    if(mid >= pos)update(2*v,l,mid,pos,val);else
        update(2*v+1,mid+1,r,pos,val);
    t[v] = max(t[2*v],t[2*v+1]);
}


int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cerr.tie(0); cout.tie(0);

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

    cin >> n >> m;

    for(int i  = 1; i <= n; i++) cin >> a[i];

    build(1,1,n);

    for(int i = 1; i <= m; i++){
        int b,x,y;
        cin >> b >> x >> y;

        if(b)update(1,1,n,x,y);else cout << get(1,x,y,1,n) << '\n';

    }

 //   rc(t[1]);
return 0;
}