#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL

pair<vector<int>,vector<int>> get(vector<int> a){
	if(a.size()==0){
		return {vector<int>(),vector<int>()};
	}
	
	auto x = a;
	sort(x.begin(),x.end());
	vector<int> y(a.size());
	rep(i,a.size()-1){
		y[i] = max(a[i],a[i+1]);
	}
	y.pop_back();
	sort(y.begin(),y.end());
	return {x,y};
}

int main(){
	
	int n,q;
	cin>>n>>q;
	vector<int> a(n);
	rep(i,n)cin>>a[i];
	int B = 400;
	vector<vector<int>> as(n/B+1,vector<int>());
	rep(i,n){
		as[i/B].push_back(a[i]);
	}
	vector<vector<int>> xs(n/B+1),ys(n/B+1);
	rep(i,as.size()){
		auto res = get(as[i]);
		xs[i] = res.first;
		ys[i] = res.second;
	}
	rep(_,q){
		int t,l,r;
		cin>>t>>l>>r;
		if(t==1){
			l--;
			as[l/B][l%B] = r;
			auto res = get(as[l/B]);
			xs[l/B] = res.first;
			ys[l/B] = res.second;
		}
		else{
			
			l--;
			int ok = 0,ng = Inf32;
			while(ng-ok>1){
				int mid = (ok+ng)/2;
				int tl = l,tr = r;
				int x = 0,y = 0;
				while(tl%B!=0 && tl<tr){
					if(as[tl/B][tl%B]<mid)x++;
					if(tl+1 < tr){
						if(max(as[tl/B][tl%B], as[(tl+1)/B][(tl+1)%B])<mid)y++;
					}
					tl++;
				}
				while(tl + B < tr){
					x += distance(xs[tl/B].begin(),lower_bound(xs[tl/B].begin(),xs[tl/B].end(),mid));
					y += distance(ys[tl/B].begin(),lower_bound(ys[tl/B].begin(),ys[tl/B].end(),mid));
					tl += B-1;
					if(max(as[tl/B][tl%B], as[(tl+1)/B][(tl+1)%B])<mid)y++;
					tl++;
				}
				while(tl<tr){
					if (as[tl/B][tl%B]<mid)x++;
					if(tl+1 < tr){
						if(max(as[tl/B][tl%B], as[(tl+1)/B][(tl+1)%B])<mid)y++;
					}
					tl++;
				}
				if(r-l + y > 2*x)ok = mid;
				else ng= mid;
			}
			cout<<ok<<endl;
		}
		
	}
	return 0;
}