#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const int INF=1e9+7;
const ll INFF=1e18+7;
#define nl '\n'
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char* x) { cout << '\"' << x << '\"'; }
void __print(const string& x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template<typename T, typename V>
void __print(const pair<T, V>& x) { cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}'; }
template<typename T>
void __print(const T& x) { int f = 0; cout << '{'; for (auto& i : x) cout << (f++ ? "," : ""), __print(i); cout << "}"; }
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cout << ", "; _print(v...); }
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

vector<int> segTree(400040), a(100001);
int n;

void build(int index, int left, int right){
    if(left==right) segTree[index]=a[left];
    else{
        int mid=(left+right)/2;
        build(2*index, left, mid);
        build(2*index+1, mid+1, right);
        segTree[index]= max(segTree[2*index],segTree[2*index+1]);
    }
}

int sum(int index,int cleft, int cright, int left, int right){
    if(left<=cleft && cright<=right) return segTree[index]; // tatal overlap
    int mid=(cleft+cright)/2;

    if(right<=mid) return sum(2*index, cleft, mid, left, right);//st
    if(mid+1<=left) return sum(2*index+1, mid+1, cright, left, right);//dr
    return max(sum(2*index, cleft, mid, left, right), sum(2*index+1, mid+1, cright, left, right));
}

void update(int index, int cleft, int cright, int uindex, int val){
    if(cleft==cright) segTree[index]=val;
    else{
        int mid=(cleft+cright)/2;
        if(uindex <= mid) update(2*index, cleft, mid, uindex, val);
        else update(2*index+1, mid+1, cright, uindex, val);
        segTree[index]=max(segTree[2*index],segTree[2*index+1]);
    }
}

void solve()
{
    int q;
    cin>>n>>q;
    for(int i=1; i<=n; i++){
        cin>>a[i];
    }
    build(1,1,n);
    for(int i=0; i<q; i++){
        int c,x,y;
        cin>>c>>x>>y;
        if(c==0) cout<<sum(1,1,n,x,y)<<nl;
        else update(1,1,n,x,y);
    }
}

int main()
{
// #ifndef ONLINE_JUDGE
    freopen("arbint.in", "r", stdin);
    freopen("arbint.out", "w", stdout);
// #endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    // int t;
    // cin >> t;
    for(int tt=1; tt<=t; tt++){
        // cout<<"#Case "<<t<<nl;
        solve();
    }
    return 0;
}