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<set>
#include<queue>
#include<cstdio>
#include<algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

const int INF=1<<29;

int main(){
	int n,q; scanf("%d%d",&n,&q);
	static int a[200000];
	rep(i,n) scanf("%d",a+i);

	const int B=10000;
	deque<int> buc[11000];
	multiset<int> S[11000];
	rep(i,(n+B-1)/B){
		rep(j,B){
			if(i*B+j>=n) break;
			buc[i].push_back(a[i*B+j]);
			S[i].insert(a[i*B+j]);
		}
	}

	while(q--){
		int type; scanf("%d",&type);
		if(type==0){
			int l,r; scanf("%d%d",&l,&r);
			int i1;
			for(i1=0;(i1+1)*B<=l;i1++);
			int j1=l-i1*B;
			int i2;
			for(i2=0;(i2+1)*B<=r;i2++);
			int j2=r-i2*B;

			int left=buc[i1][j1],right=buc[i2][j2];
			buc[i2].erase(buc[i2].begin()+j2);
			S[i2].erase(S[i2].find(right));
			buc[i1].insert(buc[i1].begin()+j1,right);
			S[i1].insert(right);
			for(int i=i1;i<i2;i++){
				int tmp=buc[i].back();
				buc[i].pop_back();
				S[i].erase(S[i].find(tmp));
				buc[i+1].push_front(tmp);
				S[i+1].insert(tmp);
			}
		}
		else if(type==1){
			int l,r; scanf("%d%d",&l,&r);
			int i1;
			for(i1=0;(i1+1)*B<=l;i1++);
			int j1=l-i1*B;
			int i2;
			for(i2=0;(i2+1)*B<=r;i2++);
			int j2=r-i2*B;

			int val=INF;
			if(i1==i2){
				for(int j=j1;j<=j2;j++) val=min(val,buc[i1][j]);
			}
			else{
				for(int j=j1;j< B;j++) val=min(val,buc[i1][j]);
				for(int j=j2;j>=0;j--) val=min(val,buc[i2][j]);
				for(int i=i1+1;i<i2;i++) val=min(val,*S[i].begin());
			}
		}
		else{
			int pos,val; scanf("%d%d",&pos,&val);
			int i;
			for(i=0;(i+1)*B<=pos;i++);
			int j=pos-i*B;
			int pre=buc[i][j];
			buc[i][j]=val;
			S[i].erase(S[i].find(pre));
			S[i].insert(val);
		}
	}

	return 0;
}