#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;
int xs[205][400005],ys[205][400005];

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 = 1000;
	vector<vector<int>> as(n/B+1,vector<int>());
	rep(i,n){
		as[i/B].push_back(a[i]);
	}
	rep(i,as.size()){
		rep(j,as[i].size()){
			xs[i][as[i][j]]++;
			if(j+1!=as[i].size()){
				ys[i][max(as[i][j],as[i][j+1])]++;
			}
		}
		rep(j,mm){
			xs[i][j+1] += xs[i][j];
			ys[i][j+1] += ys[i][j];
		}
	}
	rep(_,q){
		int t = ts[_];
		int l = ls[_],r = rs[_];
		if(t==1){
			as[l/B][l%B] = r;
			int ii = l/B;
			rep(j,mm){
				xs[ii][j] = 0;
				ys[ii][j] = 0;
			}
			rep(j,as[ii].size()){
				xs[ii][as[ii][j]]++;
				if(j+1!=as[ii].size()){
					ys[ii][max(as[ii][j],as[ii][j+1])]++;
				}
			}
			rep(j,mm){
				xs[ii][j+1] += xs[ii][j];
				ys[ii][j+1] += ys[ii][j];
			}
		}
		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;
}