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;

template<class T>
struct node{
  T val;
  T acm;
  inline T f(T a,T b){return a<=b?a:b;};
  size_t sz;
  node *parent,*left,*right;
  node():parent(nullptr),left(nullptr),right(nullptr),sz(1){}
  node(T const& v):val(v),parent(nullptr),left(nullptr),right(nullptr),sz(1){}
  int state(){
      if(!this->parent)return 0;
      if(this->parent->left==this)return 1;
      if(this->parent->right==this)return -1;
      return 0;
  }
  void rotate(){
      node<T> *pp,*p,*c;
      p = this->parent;
      pp = p->parent;
      if(p->left==this){
        c = this->right;
        this->right = p;
        p->left = c;
      }else{
        c = this->left;
        this->left = p;
        p->right = c;
      }
      if(pp && pp->left==p)pp->left = this;
      if(pp && pp->right==p)pp->right = this;
      this->parent = pp;
      p->parent = this;
      if(c)c->parent = p;
      p->update();
      this->update();
  }
  void splay(){
      while(this->state()!=0){
        if(this->parent->state()==0){
          this->rotate();
        }
        else if(this->state()==this->parent->state()){
          this->parent->rotate();
          this->rotate();
        }
        else{
          this->rotate();
          this->rotate();
        }
      }
  }
  void update(){
    this->sz = 1;
    this->acm = this->val;
    if(this->left){
      this->sz += this->left->sz;
      acm = f(acm,this->left->acm);
    }
    if(this->right){
      this->sz += this->right->sz;
      acm = f(acm,this->right->acm);
    }
  }
};

template<class T>
node<T>* get(int k,node<T>* root){
  node<T>* tmp = root;
  while(1){
    int lsz = tmp->left?tmp->left->sz:0;
    if(k<lsz){
      tmp = tmp->left;
    }
    if(k==lsz){
      tmp->splay();
      return tmp;
    }
    if(k>lsz){
      tmp = tmp->right;
      k = k-lsz-1;
    }
  }
}

template<class T>
node<T>* merge(node<T>* lroot,node<T>* rroot){
  if(!lroot)return rroot;
  if(!rroot)return lroot;
  lroot = get(lroot->sz-1,lroot);
  lroot->right = rroot;
  rroot->parent = lroot;
  lroot->update();
  return lroot;
}

template<class T>
pair<node<T>*,node<T>*> split(int left_cnt,node<T>* root){
  if(left_cnt==0)return make_pair(nullptr,root);
  if(left_cnt==root->sz)return make_pair(root,nullptr);
  root = get(left_cnt,root);
  node<T> *lroot,*rroot;
  lroot = root->left;
  rroot = root;
  rroot->left = nullptr;
  lroot->parent = nullptr;
  rroot->update();
  return make_pair(lroot,rroot);
}

template<class T>
node<T>* insert(int k,node<T>* tmp,node<T>* root){
  auto trees = split(k,root);
  node<T>* lroot = trees.first;
  node<T>* rroot = trees.second;
  return merge(merge(lroot,tmp),rroot);
}

template<class T>
pair<node<T>*,node<T>*> erase(int k,node<T>* root){
  root = get(k,root);
  node<T>* lroot = root->left;
  node<T>* rroot = root->right;
  if(lroot)lroot->parent = nullptr;
  if(rroot)rroot->parent = nullptr;
  root->left = nullptr;
  root->right = nullptr;
  root->update();
  return make_pair(merge(lroot,rroot),root);
}

template<class T>
node<T>* shift(int l,int r,node<T>* root){
  auto tmp = erase(r,root);
  root = tmp.first;
  node<T>* n = tmp.second;
  return insert(l,n,root);
}

template<class T>
pair<node<T>*,T> rmq(int l,int r,node<T>* root){
  node<T> *lroot,*croot,*rroot;
  auto tmp = split(r+1,root);
  rroot = tmp.second;
  tmp = split(l,tmp.first);
  lroot = tmp.first;
  croot = tmp.second;
  T res = croot->acm;
  return make_pair(merge(merge(lroot,croot),rroot),res);
}

node<int64_t>* a;

signed main(){

  cin.tie(0);
  ios::sync_with_stdio(false);

  int n,q;
  cin>>n>>q;
  a = new node<int64_t>[n];
  for(int i=0;i<n-1;++i){
    a[i].parent = &a[i+1];
    a[i+1].left = &a[i];
    a[i+1].update();
  }
  for(int i=0;i<n;++i){
    cin>>a[i].val;
    a[i].update();
  }

  node<int64_t>* root = &a[n-1];
  for(int i=0;i<q;++i){
    int com;
    cin>>com;
    if(com==0){
      int l,r;
      cin>>l>>r;
      root = shift(l,r,root);
    }
    if(com==1){
      int l,r;
      cin>>l>>r;
      auto tmp = rmq(l,r,root);
      root = tmp.first;
      cout<<tmp.second<<"\n";
    }
    if(com==2){
      int p;
      int64_t v;
      cin>>p>>v;
      root = get(p,root);
      root->val = v;
      root->update();
    }
  }

}