#include <bits/stdc++.h>
#define int long long
#define INF 1e+18
using namespace std;

unsigned int randxor(){
	static unsigned int x = 1239732;
	x ^= (x << 13);
	x ^= (x >> 7);
	x ^= (x << 17);
	return x;
}

struct node{
	int dat,val,size;
	node *lch,*rch;
	node(int v){
		dat = v;
		val = v;
		lch = 0;
		rch = 0;
		size = 1;
	}
};

int siz(node *t){
	if(!t) return 0;
	return t->size;
}

int dat(node *t){
	if(!t) return INF;
	return t->dat;
}

node* update(node *t){
	t->size = siz(t->lch) + siz(t->rch) + 1;
	t->dat = min(t->val,min(dat(t->lch),dat(t->rch)));
	return t;
}

node* merge(node *x,node *y){
	if(!x) return y;
	if(!y) return x;
	if(randxor() % (x->size + y->size) < x->size){
		x->rch = merge(x->rch,y);
		return update(x);
	}else{
		y->lch = merge(x,y->lch);
		return update(y);
	}
}

typedef pair<node*,node*> P;

P split(node *x,int k){
	if(!x) return P(0,0);
	if(k <= siz(x->lch)){
		P tmp = split(x->lch,k);
		x->lch = tmp.second;
		return P(tmp.first,update(x));
	}else{
		P tmp = split(x->rch,k - siz(x->lch) - 1);
		x->rch = tmp.first;
		return P(update(x),tmp.second);
	}
}

void insert(node **x,int k,node *v){
	P tmp = split(*x,k);
	*x = merge(tmp.first,merge(v,tmp.second));
}

node* erase(node **x,int k){
	P p1 = split(*x,k),p2 = split(p1.second,1);
	*x = merge(p1.first,p2.second);
	return p2.first;
}

void update(node **x,int k,int v){
	P p1 = split(*x,k),p2 = split(p1.second,1);
	p2.first->val = v;
	update(p2.first);
	*x = merge(p1.first,merge(p2.first,p2.second));
}

int get(node **x,int l,int r){
	P p1 = split(*x,l),p2 = split(p1.second,r - l);
	int ret = p2.first->dat;
	*x = merge(p1.first,merge(p2.first,p2.second));
	return ret;
}

signed main(){
	int n,q;
	node *tree = 0;
	cin >> n >> q;
	for(int i = 0;i < n;i++){
		int a;
		cin >> a;
		tree = merge(tree,new node(a));
	}
	for(int i = 0;i < q;i++){
		int x,l,r;
		cin >> x >> l >> r;
		if(!x) insert(&tree,l,erase(&tree,r));
		else if(x == 1) cout << get(&tree,l,r + 1) << endl;
		else update(&tree,l,r);
	}
	return 0;
}
