#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <fstream>
using namespace std;

const int INF=1<<30;
class Treap{
public:
  struct node_t{
    int val;// 値
    node_t *lch,*rch;// l,r
    int pri;// 優先度
    int cnt;// 部分木のサイズ
    int sum;// 部分木の値の和
    int minv;// 部分木の最小値
    node_t(int v,int p):val(v),pri(p),cnt(1),sum(v),minv(v){
      lch=rch=NULL;
    }
  };
  node_t* make_node(int val){
    return new node_t(val,rand());
  }
  int count(node_t *t){
    return !t?0:t->cnt;
  }
  int sum(node_t *t){
    return !t?0:t->sum;
  }
  int minimum(node_t *t){
    return !t?INF:t->minv;
  }
  node_t *update(node_t *t){
    t->cnt=count(t->lch)+count(t->rch)+1;
    t->sum=sum(t->lch)+sum(t->rch)+t->val;
    t->minv=min(t->val,min(minimum(t->lch),minimum(t->rch)));
    return t;
  }
  node_t *merge(node_t *l,node_t *r){
    if(!l||!r)return !l?r:l;
    // 優先順位が高い方を上に
    if(l->pri>r->pri){
      l->rch=merge(l->rch,r);
      return update(l);
    }
    else{
      r->lch=merge(l,r->lch);
      return update(r);
    }
  }
  // [0,k),[k,n)
  pair<node_t*,node_t*> split(node_t *t,int k){
    if(!t)return pair<node_t*,node_t*>(NULL,NULL);
    if(k<=count(t->lch)){
      pair<node_t*,node_t*> s=split(t->lch,k);
      t->lch=s.second;
      return make_pair(s.first,update(t));
    }
    else{
      pair<node_t*,node_t*> s=split(t->rch,k-count(t->lch)-1);
      t->rch=s.first;
      return make_pair(update(t),s.second);
    }
  }
  // [l,r)の最小値を計算
  int range_min_value(node_t *t,int l,int r){
    if(r<=l)return INF;
    // 範囲と個数が一致
    if(r-l==count(t))
      return minimum(t);
    // 左の子に完全に含まれる
    else if(count(t->lch)>=r)
      return range_min_value(t->lch,l,r);
    // 右の子に完全に含まれる
    else if(count(t->lch)<l)
      return range_min_value(t->rch,l-(count(t->lch)+1),r-(count(t->lch)+1));
    // 左と右に場合分けする
    return min(t->val,min(range_min_value(t->lch,l,count(t->lch))
                          ,range_min_value(t->rch,0,r-(count(t->lch)+1))));
  }
};

Treap tp;
int main(){
  //ifstream cin("in.txt");
  Treap::node_t *root=NULL;
  int N,Q;
  cin>>N>>Q;
  for(int i=0;i<N;i++){
    int a;
    cin>>a;
    root=tp.merge(root,tp.make_node(a));
  }
  // cout<<tp.range_min_value(root,5,6)<<endl;
  //cout<<tp.range_min_value(root,5,7)<<endl;
  //return 0;
  for(int i=0;i<Q;i++){
    int x,y,z;
    cin>>x>>y>>z;
    if(x==0){
      pair<Treap::node_t*,Treap::node_t*> p1=tp.split(root,y);
      pair<Treap::node_t*,Treap::node_t*> p2=tp.split(p1.second,z-y+1);
      Treap::node_t* a=p1.first;
      Treap::node_t* b=p2.first;
      Treap::node_t* c=p2.second;
      pair<Treap::node_t*,Treap::node_t*> p3=tp.split(b,z-y);
      b=tp.merge(p3.second,p3.first);
      root=tp.merge(tp.merge(a,b),c);
      // for(int i=0;i<N;i++){
      //   cout<<tp.range_min_value(root,i,i+1)<<endl;
      // }
      // cout<<endl;
    }
    else if(x==1){
      cout<<tp.range_min_value(root,y,z+1)<<endl;
    }
    else if(x==2){
      pair<Treap::node_t*,Treap::node_t*> p1=tp.split(root,y);
      pair<Treap::node_t*,Treap::node_t*> p2=tp.split(p1.second,1);
      delete p2.first;
      root=tp.merge(p1.first,tp.make_node(z));
      root=tp.merge(root,p2.second);
    }
  }
  
  
  return 0;
}

Measured memory_bytes: 10580