#include <iostream>
#include <cstdlib>
#include <cstdio>
using namespace std;
 
 
struct T{
        T *l,*r;
        int v;
        int c;
		int mi;
        T(int v) : v(v) , c(1) { l = r = NULL; }
        T(T *a){
                l = a->l;
                r = a->r;
                v = a->v;
                c = a->c;
				mi = v;
        }
        T(){}
};
 
#define STQN_SIZE (1000000)
T pool[STQN_SIZE+1000];
int stack_size;
 
T *my_new(int v){ return &(pool[stack_size++] = T(v)); }
T *my_new(T *a){ return &(pool[stack_size++] = T(a)); }
 
int count(T *c){
        if( !c ) return 0;
        else return c->c;
}
int getMin(T *c){
	if( !c ) return 1e9;
	return c->mi;
}

T *update(T *c){
        if( !c ) return c;
		c->mi = min(c->v,min(getMin(c->l),getMin(c->r)));
        c->c = count(c->l) + count(c->r) + 1;
        return c;
}
 
T *merge(T *a,T *b,int flag=0){
        if(!a) return b;
        if(!b) return a;
        if( rand() % ( count(a) + count(b) ) < count(a) ){
                T *R = flag ? my_new(a) : a;
                R->r = merge(a->r,b,flag);
                return update(R);
        }else{
                T *R = flag ? my_new(b) : b;
                R->l = merge(a,b->l,flag);
                return update(R);
        }
}

pair<T*,T*> split(T *c,int k,int flag=0){
        if(!c) return make_pair(c,c);
        
        T *R = flag ? my_new(c) : c;
        if(k <= count(c->l)){
                pair<T*,T*> s = split(c->l,k,flag);
                R->l = s.second;
                return make_pair(update(s.first),update(R));
        }else{
                pair<T*,T*> s = split(c->r,k - count(c->l) - 1,flag);
                R->r = s.first;
                return make_pair(update(R),update(s.second));
        }
}
T* insert(T *c,int k,int value){
        pair<T*,T*> div = split(c,k,0);
        T *mono_tree = update(my_new(value));
        return merge(merge(update(div.first),mono_tree,0),update(div.second),0);
}
 
void view(T *c){
	if( !c ) return;
	view(c->l);
	cout << c->v << " ";
	view(c->r);
}
int M,m;
 
int main(){
        T *root = NULL;
        int N,Q;
        scanf("%d%d",&N,&Q);
		
        for(int i = 0 ; i < N ; i++){
			int t; 
			scanf("%d",&t);
			root = insert(root,i,t);
        }
		for(int i = 0 ; i < Q ; i++){
			int type;
			scanf("%d",&type);
			if( type == 0 ){
				int l,r;
				scanf("%d%d",&l,&r);
				r++;
				pair<T*,T*> one = split(root,r);
				pair<T*,T*> two = split(one.first,l);
				
				pair<T*,T*> three = split(two.second,r-l-1);
				
				root = merge(three.second,three.first);
				root = merge(two.first,root);
				root = merge(root,one.second);
				
			}else if( type == 1 ){
				int l,r;
				scanf("%d%d",&l,&r);
				r++;
				
				pair<T*,T*> one = split(root,r);
				pair<T*,T*> two = split(one.first,l);
				
				printf("%d\n",getMin(two.second));
				
				root = merge(two.first,two.second);
				root = merge(root,one.second);
			}else if( type == 2 ){
				int p,x;
				scanf("%d%d",&p,&x);
				pair<T*,T*> one = split(root,p);
				pair<T*,T*> two = split(one.second,1);
				two.second = insert(two.second,0,x);
				root = merge(one.first,two.second);
			}
			//view(root);	cout << " " << getMin(root) << endl;
		}
		
}

Measured memory_bytes: 11424