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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;
const int INF = 1e9;


typedef int Value;
struct Treap{
  Value value;
  Value mn;
  int p;
  int cnt;
  Treap* ch[2]; // 0: left, 1: right
  Treap(const Value& value_):
	value(value_), mn(value_), p(rand()), cnt(1)
  {
	ch[0] = ch[1] = nullptr;
  }
};

int count(Treap* t){
  return (t == nullptr? 0: t->cnt);
}
Value min(Treap* t){
  return (t == nullptr? INF: t->mn);
}

Treap* update(Treap* t){
  t->cnt = count(t->ch[0]) + count(t->ch[1]) + 1;
  t->mn = min(min(min(t->ch[0]), min(t->ch[1])), t->value);
  return t;
}

Treap* merge(Treap* l, Treap* r){
  if(l == nullptr) return r;
  if(r == nullptr) return l;

  if(l->p > r->p){
	l->ch[1] = merge(l->ch[1], r);
	return update(l);
  }
  else{
	r->ch[0] = merge(l, r->ch[0]);
	return update(r);
  }
}

// split <[0,k),[k,n)>
pair<Treap*,Treap*> split(Treap* t, int k){
  if(t == nullptr) return MP(nullptr, nullptr);

  pair<Treap*,Treap*> res;
  if(k <= count(t->ch[0])){
	res = split(t->ch[0], k);
	t->ch[0] = res.second;
	res.second = update(t);
  }
  else{
	res = split(t->ch[1], k - count(t->ch[0]) - 1);
	t->ch[1] = res.first;
	res.first = update(t);
  }
  return res;
}

Treap* insert(Treap* t, int k, int v){
  auto sp = split(t, k);
  Treap* u = new Treap(v);
  return merge(merge(sp.first, u), sp.second);
}

Treap* updateVal(Treap* t, int k, int v){
  auto sp1 = split(t, k);
  auto sp2 = split(sp1.second, 1);
  sp2.first->value = sp2.first->mn = v;
  return merge(sp1.first, merge(sp2.first, sp2.second));
}

Treap* rmq(Treap* t, int l, int r, Value& res){
  auto sp1 = split(t, l);
  auto sp2 = split(sp1.second, r-l);
  res = sp2.first->mn;
  return merge(sp1.first, merge(sp2.first, sp2.second));
}

Treap* shift(Treap* t, int l, int r){
  auto sp1 = split(t, l);
  auto sp2 = split(sp1.second, r-l);
  auto rot = split(sp2.first, r-l-1);
  
  return merge(sp1.first, merge(merge(rot.second, rot.first), sp2.second));
}

void debug(Treap* t, string s = ""){
  if(t == nullptr) return;
  cout << s << ": " << t->value <<","<<t->cnt<<endl;
  debug(t->ch[0], s+"L");
  debug(t->ch[1], s+"R");
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N, Q; cin >> N >> Q;
  Treap* t = nullptr;
  REP(i,N){
	int a; cin >> a;
	t = insert(t, i, a);
  }

  REP(q,Q){
	int x, y, z; cin >> x >> y >> z;
	if(x == 0){
	  t = shift(t, y, z+1);
	}
	else if(x == 1){
	  int res = INF;
	  t = rmq(t, y, z+1, res);
	  cout << res << endl;
	}
	else{
	  t = updateVal(t, y, z);
	}
  }

  return 0;
}

Measured memory_bytes: 12544