#include <iostream>
using namespace std;
 
const int N = 200000;
int tree[N + 1];
int leaf[N+1];
int len[N+1];
int par[N+1];
int n, q;
 
void build_links(const int i){
    const int L=len[i-1];
    len[i]=1;
    
    if(L==len[i-1-L]){
    	len[i]+=2*L;
    	par[i-1]=i;
    	par[i-1-L]=i;
    }
}
 
void combine(const int i) {
    tree[i]=leaf[i];
    if(len[i]>1){
    	tree[i]=min(tree[i-1],tree[i]);
    	tree[i]=min(tree[i-1-len[i-1]],tree[i]);
    }
}
 
int query(const int l, int r) {
    int res = leaf[r];
    while (l <= r) {
        int next_r = r-len[r];
        bool exceed = next_r < l-1;
        int val=exceed?leaf[r]:tree[r];
        res=min(val,res);
        r=exceed?r-1:next_r;
    }
    return res;
}
 
void modify(int i, int v){
	leaf[i]=v;
	while(i){
	    combine(i);
            i=par[i];
	}
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
    	build_links(i);
    }
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        leaf[i]=x;
        combine(i);
    }
    while (q--) {
        int t, a, b;
        cin >> t>> a >> b;
        if (t==1){
            modify(a,b);
            continue;
        }
        cout << query(a, b) << '\n';
    }
}