#include <bits/stdc++.h>
using namespace std;

#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define mp(a,b) make_pair((a),(b))
#define debug(x) #x << "=" << (x)
 
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif

typedef long long int ll;
typedef pair<int,int> pii;
//template<typename T> using vec=std::vector<T>;

const int INF=1<<30;
const long long int INFLL=1LL<<58;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
	os << "[";
	for (const auto &v : vec) {
		os << v << ",";
	}
	os << "]";
	return os;
}

/*
template<class T> class treap{
    public:
    struct node{
        T val,sum;
        node *left,*right;
        int pri;
        unsigned sz;
        node(T val,int pri):val(val),sum(sum),pri(pri),sz(1){
            left=right=NULL;
        }
    };
    
    node *root;
    treap():root(NULL){
        srand(time(NULL));
    }
    
    unsigned size(){ return size(root); }
    unsigned size(node *v){ return !v?0:v->sz; }
    T sum(node *v){ return !v?0:v->sum; }
    
    node *update(node *v){
        v->sz=size(v->left)+size(v->right)+1;
        v->sum=sum(v->left)+sum(v->right)+v->val;
        return v;
    }
    
    node *merge(node *s,node *t){
        if(!s or !t) return s?s:t;
        if(s->pri > t->pri){
            s->right=merge(s->right,t);
            return update(s);
        }
        t->left=merge(s,t->left);
        return update(t);
    }
    
    pair<node*,node*> split(node *v,unsigned k){ //[0,k),[k,n)
        if(!v) return pair<node*,node*>(NULL,NULL);
        if(k<=size(v->left)){
            pair<node*,node*> s=split(v->left,k);
            v->left=s.second;
            return make_pair(s.first,update(v));
        }
        pair<node*,node*> s=split(v->right,k-size(v->left)-1);
        v->right=s.first;
        return make_pair(update(v),s.second);
    }
    
    node *find(unsigned k){
        node *v=root;
        while(v){
            unsigned s=size(v->left);
            if(s>k) v=v->left;
            else if(s==k) return v;
            else{
                v=v->right;
                k-=s+1;
            }
        }
        return v;
    }
    
    void insert(unsigned k,T val){ root=insert(root,k,val,rand()); }
    node *insert(node *t,unsigned k,T val,int pri){
        pair<node*,node*> s=split(t,k);
        t=merge(s.first,new node(val,pri));
        t=merge(t.s.second);
        return update(t);
    }
    
    void erase(int k){ root=erase(root,k); }
    node *erase(node *t,unsigned k){
        pair<node*,node*> u,v;
        u=split(t,k+1);
        v=split(u.first,k);
        t=merge(v.first,u.second);
        return update(t);
    }
};
*/

template<class T> class treap{
    public:
    struct node{
        T val,min;
        node *left,*right;
        int pri;
        unsigned sz;
        node(T val,int pri):val(val),min(val),pri(pri),sz(1){
            left=right=NULL;
        }
    };
    
    node *root;
    treap():root(NULL){
        srand(time(NULL));
    }
    
    unsigned size(){ return size(root); }
    unsigned size(node *v){ return !v?0:v->sz; }
    T min(node *v){ return !v?INF:v->min; }
    
    node *update(node *v){
        v->sz=size(v->left)+size(v->right)+1;
        v->min=std::min({min(v->left),min(v->right),v->val});
        return v;
    }
    
    node *merge(node *s,node *t){
        if(!s or !t) return s?s:t;
        if(s->pri > t->pri){
            s->right=merge(s->right,t);
            return update(s);
        }
        t->left=merge(s,t->left);
        return update(t);
    }
    
    pair<node*,node*> split(node *v,unsigned k){ //[0,k),[k,n)
        if(!v) return pair<node*,node*>(NULL,NULL);
        if(k<=size(v->left)){
            pair<node*,node*> s=split(v->left,k);
            v->left=s.second;
            return make_pair(s.first,update(v));
        }
        pair<node*,node*> s=split(v->right,k-size(v->left)-1);
        v->right=s.first;
        return make_pair(update(v),s.second);
    }
    
    node *find(unsigned k){
        node *v=root;
        while(v){
            unsigned s=size(v->left);
            if(s>k) v=v->left;
            else if(s==k) return v;
            else{
                v=v->right;
                k-=s+1;
            }
        }
        return v;
    }
    
    void insert(unsigned k,T val){ root=insert(root,k,val,rand()); }
    node *insert(node *t,unsigned k,T val,int pri){
        pair<node*,node*> s=split(t,k);
        t=merge(s.first,new node(val,pri));
        t=merge(t,s.second);
        return update(t);
    }
    
    void erase(int k){ root=erase(root,k); }
    node *erase(node *t,unsigned k){
        pair<node*,node*> u,v;
        u=split(t,k+1);
        v=split(u.first,k);
        t=merge(v.first,u.second);
        return update(t);
    }
    
    //[l,r)
    void shift(int l,int r){
        pair<node*,node*> u,v,w;
        u=split(root,r);
        v=split(u.first,r-1);
        w=split(v.first,l);
        merge(merge(w.first,v.second),merge(w.second,u.second));
    }
    
    void min(int l,int r){
        pair<node*,node*> u,v;
        u=split(root,r);
        v=split(u.first,l);
        cout << min(v.second) << endl;
        merge(merge(v.first,v.second),u.second);
    }
    
    void update(int pos,int val){
        pair<node*,node*> u,v;
        u=split(root,pos+1);
        v=split(u.first,pos);
        v.second->val=val;
        update(v.second);
        merge(merge(v.first,v.second),u.second);
    }
};

void Solve(){
    int n,q;
    cin >> n >> q;
    
    treap<int> t;
    rep(i,0,n){
        int a;
        cin >> a;
        t.insert(i,a);
    }
    
    rep(i,0,q){
        int x,y,z;
        cin >> x >> y >> z;
        if(x==0) t.shift(y,z+1);
        else if(x==1) t.min(y,z+1);
        else t.update(y,z);
    }
}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	Solve();
	return 0;
}

Measured memory_bytes: 10588