Go: package main

// packed from [splaytree.go main.rmq.go splaytree_debug.go] with goone.

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
	"strings"
)

type SplayTreeNode struct {
	parent, left, right *SplayTreeNode

	size    int
	value   int
	minimum int
}

func newSplayTreeNode(v int) *SplayTreeNode {
	return &SplayTreeNode{value: v}
}

func (node *SplayTreeNode) rotate() {
	var pp, p, c *SplayTreeNode
	p = node.parent
	pp = p.parent
	if pp != nil && pp.left == p {
		pp.left = node
	}
	if pp != nil && pp.right == p {
		pp.right = node
	}
	node.parent = pp
	if p.left == node {
		c = node.right
		node.right = p
		p.left = c
	} else {
		c = node.left
		node.left = p
		p.right = c
	}
	p.parent = node
	if c != nil {
		c.parent = p
	}
	p.update()
	node.update()
}

func (node *SplayTreeNode) state() int {
	if node.parent == nil {
		return 0
	}
	if node.parent.left == node {
		return -1
	} else if node.parent.right == node {
		return 1
	}
	return 0
}

func (node *SplayTreeNode) splay() {
	for node.state() != 0 {
		if node.parent.state() == 0 {
			node.rotate()
			return
		}
		if node.state() == node.parent.state() {
			node.parent.rotate()
			node.rotate()
		} else {
			node.rotate()
			node.rotate()
		}
	}
}

func (node *SplayTreeNode) update() {
	node.size = 1
	node.minimum = node.value
	if node.left != nil {
		node.size += node.left.size
		node.minimum = min(node.minimum, node.left.minimum)
	}
	if node.right != nil {
		node.size += node.right.size
		node.minimum = min(node.minimum, node.right.minimum)
	}
}
func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func (node *SplayTreeNode) Get(idx int) *SplayTreeNode {
	cur := node
	for true {
		lSize := 0
		if cur.left != nil {
			lSize = cur.left.size
		}
		if idx < lSize {
			cur = cur.left
		}
		if lSize == idx {
			cur.splay()
			return cur
		}
		if idx > lSize {
			cur = cur.right
			idx = idx - lSize - 1
		}
	}
	return nil
}

func mergeSplayNode(l, r *SplayTreeNode) (root *SplayTreeNode) {
	if l == nil {
		return r
	}
	if r == nil {
		return l
	}
	root = l.Get(l.size - 1)
	root.right = r
	r.parent = root
	root.update()
	return root
}

func (node *SplayTreeNode) Split(leftCount int) (left *SplayTreeNode, right *SplayTreeNode) {
	root := node.Get(leftCount)
	lRoot, rRoot := root.left, root

	rRoot.left = nil
	if lRoot != nil {
		lRoot.parent = nil
	}
	rRoot.update()
	return lRoot, rRoot
}

func splayTreeInsert(t *SplayTreeNode, idx int, node *SplayTreeNode) (root *SplayTreeNode) {
	l, r := t.Split(idx)
	return mergeSplayNode(
		mergeSplayNode(l, node),
		r,
	)
}

func removeSplayTree(t *SplayTreeNode, idx int) (root *SplayTreeNode, removed *SplayTreeNode) {
	target := t.Get(idx)
	l, r := target.left, target.right
	if l != nil {
		l.parent = nil
	}
	if r != nil {
		r.parent = nil
	}
	target.left = nil
	target.right = nil
	target.update()
	return mergeSplayNode(l, r), target
}

const (
	initialBufSize = 100000
	maxBufSize     = 1000000
)

var sc *bufio.Scanner

func initScanner(r io.Reader) *bufio.Scanner {
	buf := make([]byte, initialBufSize)

	sc := bufio.NewScanner(r)
	sc.Buffer(buf, maxBufSize)
	sc.Split(bufio.ScanWords)
	return sc
}

func main() {
	sc = initScanner(os.Stdin)
	resolve()
}

func resolve() {
	n := scanInt(sc)
	q := scanInt(sc)
	table := newDebugNodeSlice(200001)
	for i := 0; i < n; i++ {
		table.l[i].parent = &table.l[i+1]
		table.l[i+1].left = &table.l[i]
		table.l[i].update()
		table.l[i+1].update()
	}
	var root *SplayTreeNode = &table.l[n]
	for i := 0; i < n; i++ {
		table.l[i].value = scanInt(sc)
		table.l[i].update()
	}
	table.l[n].update()
	for i := 0; i < q; i++ {
		switch scanInt(sc) {
		case 0:
			root = shift(root, scanInt(sc), scanInt(sc))
		case 1:
			l := scanInt(sc)
			r := scanInt(sc)
			tmp, rRoot := root.Split(r + 1)
			lRoot, cRoot := tmp.Split(l)
			fmt.Println(cRoot.minimum)
			root = mergeSplayNode(mergeSplayNode(lRoot, cRoot), rRoot)
		case 2:
			root = root.Get(scanInt(sc))
			root.value = scanInt(sc)
			root.update()
		}
	}
}


C++: #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;
}