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>

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

using namespace std;

struct Node{
	Node *l,*r;
	int d,s,mn;
};

using NP=Node*;

const int poolSize=1000000;
Node buf[poolSize];
stack<NP> pool;
void InitPool(){
	REP(i,poolSize)
		pool.push(buf+i);
}

int Depth(NP x){
	return x?x->d:0;
}

int Size(NP x){
	return x?x->s:0;
}

const int inf=1145141919;

int Mini(NP x){
	return x?x->mn:inf;
}

void delNode(NP x){
	pool.push(x);
}

NP newNode(NP l,NP r,int v=inf){
	NP x=pool.top();
	pool.pop();
	*x=Node{l,r,max(Depth(l),Depth(r))+1,Size(l)+Size(r),min({v,Mini(l),Mini(r)})};
	return x;
}

Node Merge1(NP a,NP b,NP c){
	if(abs(max(Depth(a),Depth(b))+1-Depth(c))<=1)
		return Node{newNode(a,b),c};
	else if(abs(max(Depth(b),Depth(c))+1-Depth(a))<=1)
		return Node{a,newNode(b,c)};
	Node ret=Node{newNode(a,b->l),newNode(b->r,c)};
	delNode(b);
	return ret;
}

Node Merge2(NP a,NP b){
	if(Depth(a)==Depth(b))
		return Node{a,b};
	else if(Depth(a)>Depth(b)){
		Node m=Merge2(a->r,b);
		Node ret=Merge1(a->l,m.l,m.r);
		delNode(a);
		return ret;
	}else{
		Node m=Merge2(a,b->l);
		Node ret=Merge1(m.l,m.r,b->r);
		delNode(b);
		return ret;
	}
}

NP Merge(NP a,NP b){
	if(!a)
		return b;
	if(!b)
		return a;
	Node m=Merge2(a,b);
	return newNode(m.l,m.r);
}

Node Split(NP x,int k){
	if(k<=0)
		return Node{NULL,x};
	if(Size(x)<=k)
		return Node{x,NULL};
	if(k<=Size(x->l)){
		Node s=Split(x->l,k);
		Node ret=Node{s.l,Merge(s.r,x->r)};
		delNode(x);
		return ret;
	}else{
		Node s=Split(x->r,k-Size(x->l));
		Node ret=Node{Merge(x->l,s.l),s.r};
		delNode(x);
		return ret;
	}
}

void Update(NP x,int k,int v){
	if(Size(x)==1){
		x->mn=v;
		return;
	}
	if(k<Size(x->l))
		Update(x->l,k,v);
	else
		Update(x->r,k-Size(x->l),v);
	x->mn=min(Mini(x->l),Mini(x->r));
}

int read(){
	int i;
	scanf("%d",&i);
	return i;
}

NP t[100000];

int main(){
	InitPool();
	int n=read(),q=read();
	REP(i,n){
		t[i]=newNode(NULL,NULL,read());
		t[i]->s=1;
	}
	while(n>1){
		int k=n/2;
		REP(i,k)
			t[i]=Merge(t[i*2],t[i*2+1]);
		if(k*2<n)
			t[k]=t[k*2];
		n=(n+1)/2;
	}
	NP root=t[0];
	REP(_,q){
		int x=read(),y=read(),z=read();
		if(x==0){
			Node s1=Split(root,y);
			Node s2=Split(s1.r,z+1-y-1);
			Node s3=Split(s2.r,1);
			root=Merge(Merge(s1.l,s3.l),Merge(s2.l,s3.r));
		}else if(x==1){
			Node s1=Split(root,y);
			Node s2=Split(s1.r,z+1-y);
			printf("%d\n",Mini(s2.l));
			root=Merge(s1.l,Merge(s2.l,s2.r));
		}else if(x==2){
			Update(root,y,z);
		}
	}
}