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<algorithm>
#include<map>
using namespace std;
#define INF (1 << 30)
struct Node{
    int val, min, size;
    Node *l, *r;
    Node(int v){
	size = 1;
	val = v;
	min = v;
	l = r = NULL;
    }
};

typedef pair<Node*, Node*> P;

Node *root = new Node(0);

Node *update(Node *a){
    if(a == 0)return a;
    a->min = min(a->l?a->l->min:INF, a->r?a->r->min:INF);
    a->min = min(a->min, a->val);
    a->size = 1 + (a->l?a->l->size:0) + (a->r?a->r->size:0);
    return a;
}

Node *merge(Node *a, Node *b){
    if(a == NULL)return b;
    if(b == NULL)return a;
    if(rand() % (a->size + b->size) < a->size){
	a->r = merge(a->r, b);
	return update(a);
    }
    else{
	b->l = merge(a, b->l);
	return update(b);
    }
}

P split(Node *p, int v){
    if(v == 0)return P(NULL, p);
    int lsize = (p->l)?p->l->size:0;
    if(lsize < v){
	P tmp = split(p->r, v - lsize - 1);
	p->r = tmp.first;
	return P(update(p), update(tmp.second));
    }
    else{
	P tmp = split(p->l, v);
	p->l = tmp.second;
	return P(update(tmp.first), update(p));
    }
}

void shift(int l, int r){
    P tmpr = split(root, r + 1);
    P tmpl = split(tmpr.first, l);
    P tmpc = split(tmpl.second, r - l);
    tmpl.second = merge(tmpc.second, tmpc.first);
    
    tmpr.first = merge(tmpl.first, tmpl.second);
    root = merge(tmpr.first, tmpr.second);
}

int solve(int l, int r){
    P tmpr = split(root, r);
    P tmpl = split(tmpr.first, l);
    int ans = tmpl.second->min;
    tmpr.first = merge(tmpl.first, tmpl.second);
    root = merge(tmpr.first, tmpr.second);
    return ans;
}

void setnum(int x, int v){
    P tmpr = split(root, x);
    P tmpl = split(tmpr.second, 1);
    tmpr.second = merge(new Node(v), tmpl.second);
    root = merge(tmpr.first, tmpr.second);
}

int main(){
    int n, q, a, x, y, z;
    cin >> n >> q;
    for(int i = 1;i <= n;i++){
	cin >> a;
	root = merge(root, new Node(a));
    }
    
    for(int i = 0;i < q;i++){
	cin >> x >> y >> z;
	if(x == 0){
	    shift(y + 1, z + 1);
	}
	if(x == 1){
	    cout << solve(y + 1, z + 2) << endl;
	}
	if(x == 2){
	    setnum(y + 1, z);
	}
    }
    return 0;
}