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 <iostream>
#include <cstdlib>
#include <cstdio>
using namespace std;
 
 
struct T{
        T *l,*r;
        int v;
        int c;
		int mi;
        T(int v) : v(v) , c(1) { l = r = NULL; }
        T(T *a){
                l = a->l;
                r = a->r;
                v = a->v;
                c = a->c;
				mi = v;
        }
        T(){}
};
 
#define STQN_SIZE (1000000)
T pool[STQN_SIZE+1000];
int stack_size;
 
T *my_new(int v){ return &(pool[stack_size++] = T(v)); }
T *my_new(T *a){ return &(pool[stack_size++] = T(a)); }
 
int count(T *c){
        if( !c ) return 0;
        else return c->c;
}
int getMin(T *c){
	if( !c ) return 1e9;
	return c->mi;
}

T *update(T *c){
        if( !c ) return c;
		c->mi = min(c->v,min(getMin(c->l),getMin(c->r)));
        c->c = count(c->l) + count(c->r) + 1;
        return c;
}
 
T *merge(T *a,T *b,int flag=0){
        if(!a) return b;
        if(!b) return a;
        if( rand() % ( count(a) + count(b) ) < count(a) ){
                T *R = flag ? my_new(a) : a;
                R->r = merge(a->r,b,flag);
                return update(R);
        }else{
                T *R = flag ? my_new(b) : b;
                R->l = merge(a,b->l,flag);
                return update(R);
        }
}

pair<T*,T*> split(T *c,int k,int flag=0){
        if(!c) return make_pair(c,c);
        
        T *R = flag ? my_new(c) : c;
        if(k <= count(c->l)){
                pair<T*,T*> s = split(c->l,k,flag);
                R->l = s.second;
                return make_pair(update(s.first),update(R));
        }else{
                pair<T*,T*> s = split(c->r,k - count(c->l) - 1,flag);
                R->r = s.first;
                return make_pair(update(R),update(s.second));
        }
}
T* insert(T *c,int k,int value){
        pair<T*,T*> div = split(c,k,0);
        T *mono_tree = update(my_new(value));
        return merge(merge(update(div.first),mono_tree,0),update(div.second),0);
}
 
void view(T *c){
	if( !c ) return;
	view(c->l);
	cout << c->v << " ";
	view(c->r);
}
int M,m;
 
int main(){
        T *root = NULL;
        int N,Q;
        scanf("%d%d",&N,&Q);
		
        for(int i = 0 ; i < N ; i++){
			int t; 
			scanf("%d",&t);
			root = insert(root,i,t);
        }
		for(int i = 0 ; i < Q ; i++){
			int type;
			scanf("%d",&type);
			if( type == 0 ){
				int l,r;
				scanf("%d%d",&l,&r);
				r++;
				pair<T*,T*> one = split(root,r);
				pair<T*,T*> two = split(one.first,l);
				
				pair<T*,T*> three = split(two.second,r-l-1);
				
				root = merge(three.second,three.first);
				root = merge(two.first,root);
				root = merge(root,one.second);
				
			}else if( type == 1 ){
				int l,r;
				scanf("%d%d",&l,&r);
				r++;
				
				pair<T*,T*> one = split(root,r);
				pair<T*,T*> two = split(one.first,l);
				
				printf("%d\n",getMin(two.second));
				
				root = merge(two.first,two.second);
				root = merge(root,one.second);
			}else if( type == 2 ){
				int p,x;
				scanf("%d%d",&p,&x);
				pair<T*,T*> one = split(root,p);
				pair<T*,T*> two = split(one.second,1);
				two.second = insert(two.second,0,x);
				root = merge(one.first,two.second);
			}
			//view(root);	cout << " " << getMin(root) << endl;
		}
		
}