#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define vec vector
#define flist forward_list
#define um unordered_map
#define us unordered_set
#define prioq priority_queue
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define ld long double
#define pll pair<ll, ll>

#define LL_MAX LLONG_MAX
#define LL_MIN LLONG_MIN
#define ULL_MAX ULLONG_MAX
#define ULL_MIN 0
#define LD_MAX LDBL_MAX
#define LD_MIN LDBL_MIN

#define nl '\n'

#define vv(type, name, n, ...) vector<vector<type>> name(n, vector<type>(__VA_ARGS__))
#define vvv(type, name, n, m, ...)                                                                                     \
    vector<vector<vector<type>>> name(n, vector<vector<type>>(m, vector<type>(__VA_ARGS__)))

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rep1e(n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2e(i,n) for(ll i=1; i<=(ll)(n); ++i)
#define rep3e(i,a,b) for(ll i=(ll)(a); i<=(ll)(b); ++i)
#define rep4e(i,a,b,c) for(ll i=(ll)(a); i<=(ll)(b); i+=(c))
#define repe(...) cut4(__VA_ARGS__,rep4e,rep3e,rep2e,rep1e)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define per1e(n) for(ll i=((ll)n); i>=1; --i)
#define per2e(i,n) for(ll i=((ll)n); i>=1; --i)
#define per3e(i,a,b) for(ll i=((ll)a); i>=(ll)(b); --i)
#define per4e(i,a,b,c) for(ll i=((ll)a); i>=(ll)(b); i-=(c))
#define pere(...) cut4(__VA_ARGS__,per4e,per3e,per2e,per1e)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))
// #define forit(v) for (auto it = v.begin(); it != v.end(); it++)
// #define forit2(it, v) for (auto it = v.begin(); it != v.end(); it++)
// #define forrit(v) for (auto it = v.rbegin(); it != v.rend(); it++)
// #define forrit2(it, v) for (auto it = v.rbegin(); it != v.rend(); it++)

// #ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<vector<T>> x){cerr << "\n"; for(auto i: x) {for(auto j : i) {cerr << j << ' ';} cerr << "\n";}}
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
// #else
// #define bug(...) 777771449
// #endif

const ll MOD = 1e9 + 7;

const string FILENAME = "arbint";
ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");

#define cin fin
#define cout fout

class segTree
{
public:

	ll n;
	vec<ll> st, *nums;
	
	void build(vec<ll>& v)
	{
		n = v.size();
		nums = &v;
		st.resize(2 * n - 2);
		build_(0, 0, n - 1);
	}
	void build_(ll i, ll l, ll r)
	{
		if(l == r)
		{
			st[i] = (*nums)[l];
			return;
		}
		
		build_(i + 1, l, (l + r) / 2);
		build_(i + 2 * ((l+r)/2 - l + 1), (l + r) / 2 + 1, r);
		st[i] = max(st[i + 1], st[i + 2 * ((l+r)/2 - l + 1)]);
	}
	ll query(ll l, ll r)
	{
		return query_(0, 0, n - 1, l, r);
	}
	ll query_(ll i, ll l, ll r, ll x, ll y)
	{
		if(x <= l && r <= y) return st[i];
		if(r < x || y < l) return -1;
		return max(query_(i + 1, l, (l + r) / 2, x, y), query_(i + 2 * ((l+r)/2 - l + 1), (l + r) / 2 + 1, r, x, y));
	}
	void update(ll pos, ll val)
	{
		update_(0, 0, n - 1, pos, val);
	}
	void update_(ll i, ll l, ll r, ll pos, ll val)
	{
		if(l == r)
		{
			(*nums)[pos] = val;
			st[i] = val;
			return;
		}
		
		if(pos <= (l + r) / 2)
			update_(i + 1, l, (l + r) / 2, pos, val);
		else
			update_(i + 2 * ((l+r)/2 - l + 1), (l + r) / 2 + 1, r, pos, val);
		
		st[i] = max(st[i + 1], st[i + 2 * ((l+r)/2 - l + 1)]);
	}
};

int main()
{
	ll n, q;
	cin >> n >> q;
	
	vec<ll> nums(n);
	rep(n) cin >> nums[i];
	
	segTree st;
	st.build(nums);
	
	rep(q)
	{
		ll t, x, y;
		cin >> t >> x >> y;
		
		if(t == 0)
		{
			x--;
			y--;
			cout << st.query(x, y) << nl;
		}
		else
		{
			x--;
			st.update(x, y);
		}
	}
	
	return 0;
}