/**
	author:  shobonvip
	created: 2025.04.20 03:19:02
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

const int INF = (int)1e9 + 50;

struct S {
	int m1, m2;
};

S op(S a, S b) {
	if (a.m1 > b.m1) {
		if (a.m2 > b.m1) {
			return a;
		} else {
			return S{a.m1, b.m1};
		}
	}else {
		if (a.m1 > b.m2) {
			return S{b.m1, a.m1};
		} else {
			return b;
		}
	}
}

S e() {
	return S{-INF, -INF};
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, q; cin >> n >> q;
	vector<int> a(n);
	rep(i,0,n) {
		cin >> a[i];
	}

	segtree<S,op,e> seg(n);
	rep(i,0,n-1) {
		seg.set(i, S{min(a[i], a[i+1]), -INF});
	}

	auto query = [&](int l, int r) -> int {
		if (r - l == 1) {
			return a[l];
		}

		int ub = INF - 5;
		int lb = -1;
		S prod = seg.prod(l, r-1);
		//cout << prod.m1 << ' ' << prod.m2 << endl;
		while (ub - lb > 1) {
			int t = lb + (ub - lb) / 2;
			int cnt = 0;
			if (a[l] >= t) cnt++;
			if (a[r-1] >= t) cnt++;
			if (cnt == 2) {
				lb = t;
				continue;
			}
			if (cnt == 1) {
				if (prod.m1 >= t) {
					lb = t;
					continue;
				}else {
					ub = t;
					continue;
				}
			}
			if (prod.m2 >= t) {
				lb = t;
				continue;
			}else {
				ub = t;
				continue;
			}
		}
		return lb;
	};

	while(q--) {
		int t; cin >> t;
		if (t == 1) {
			int i; cin >> i;
			i--;
			int x; cin >> x;
			a[i] = x;
			if (i-1 >= 0) {
				seg.set(i-1, S{min(a[i-1], a[i]), -INF});
			}
			if (i+1 < n) {
				seg.set(i, S{min(a[i], a[i+1]), -INF});
			}
		} else {
			int l, r;
			cin >> l >> r;
			l--;
			cout << query(l, r) << endl;
		}
	}
}