#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
int mm;
pair<vector<int>,vector<int>> get(vector<int> a){
	vector<int> x(mm),y(mm);
	rep(i,a.size()){
		x[a[i]]++;
	}
	if(a.size()>=1){
		rep(i,a.size()-1){
			y[max(a[i],a[i+1])]++;
		}
	}
	rep(i,mm-1){
		x[i+1] += x[i];
		y[i+1] += y[i];
	}
	return {x,y};
	
}

int main(){
	
	int n,q;
	cin>>n>>q;
	vector<int> a(n);
	rep(i,n)cin>>a[i];
	vector<int> ts(q),ls(q),rs(q);
	vector<int> vs = a;
	rep(i,q){
		cin>>ts[i]>>ls[i]>>rs[i];
		ls[i]--;
		if(ts[i]==1)vs.push_back(rs[i]);
	}
	sort(vs.begin(),vs.end());
	vs.erase(unique(vs.begin(),vs.end()),vs.end());
	mm = vs.size();
	rep(i,n){
		a[i] = lower_bound(vs.begin(),vs.end(),a[i])-vs.begin();
	}
	rep(i,q){
		if(ts[i]==1)rs[i] = lower_bound(vs.begin(),vs.end(),rs[i])-vs.begin();
	}
	int B = 500;
	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 = ts[_];
		int l = ls[_],r = rs[_];
		if(t==1){
			as[l/B][l%B] = r;
			auto res = get(as[l/B]);
			xs[l/B] = res.first;
			ys[l/B] = res.second;
		}
		else{
			int ok = 0,ng = mm;
			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 += xs[tl/B][mid-1];//distance(xs[tl/B].begin(),lower_bound(xs[tl/B].begin(),xs[tl/B].end(),mid));
					y += ys[tl/B][mid-1];//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<<vs[ok]<<endl;
		}
		
	}
	return 0;
}