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 <stdio.h>
const int INF=1e9+10;
long long int now=1234819384719LL;
bool rand(int a,int b){
    now^=1932847192384LL;
    now+=1293419328471LL;
    now%=(a+b);
    return now>=b;
}
int min(int a,int b){return a<b?a:b;}
struct node{
    node* l;
    node* r;
    int val;
    int top;
    int size;
    node(int n){
        l=r=nullptr;
        val=top=n;
        size=1;
    }
    void pull(){
        size=1;
        top=val;
        if(l){
            size+=l->size;
            top=min(top,l->top);
        }
        if(r){
            size+=r->size;
            top=min(top,r->top);
        }
        return ;
    }
    void out(){
        if(l){
            l->out();
            printf(" ");
        }
        printf("%d",val);
        if(r){
            printf(" ");
            r->out();
        }
        return ;
    }
    int lsize(){
        return l?l->size+1:1;
    }
};
node* merge(node* a,node* b){
    if(!a)return b;
    if(!b)return a;
    if(rand(a->size,b->size)){
        a->r=merge(a->r,b);
        a->pull();
        return a;
    }
    else{
        b->l=merge(a,b->l);
        b->pull();
        return b;
    }
}
void split(node* s,int n,node*&a,node*&b){
    if(!s){
        a=b=nullptr;
        return ;
    }
    if(s->lsize()>n){
        b=s;
        split(s->l,n,a,b->l);
        b->pull();
    }
    else{
        a=s;
        split(s->r,n-s->lsize(),a->r,b);
        a->pull();
    }
    return ;
}
int find(node* s,int pl,int pr,int L,int R){
    int ans=INF;
    if(L>pr||pl>R||!s)return ans;
    if(L<=pl){
        if(pr<=R)return s->top;
        if(s->lsize()+pl-1<=R){
            if(s->l)ans=min(ans,s->l->top);
            ans=min(ans,min(s->val,find(s->r,s->lsize()+pl,pr,L,R)));
        }
        else return find(s->l,pl,s->lsize()+pl-2,L,R);
    }
    else if(pr<=R){
        if(s->lsize()+pl-1>=L){
            if(s->r)ans=min(ans,s->r->top);
            ans=min(ans,min(s->val,find(s->r,pl,s->lsize()+pl-2,L,R)));
        }
        else return find(s->r,s->lsize()+pl,pr,L,R);
    }
    else{
        if(L<=s->lsize()+pl-1&&s->lsize()+pl-1<=R)ans=min(ans,s->val);
        ans=min(ans,min(find(s->l,pl,s->lsize()+pl-2,L,R),find(s->r,s->lsize()+pl,pr,L,R)));
    }
    return ans;
}
int main(){
    int n,q,k,temp,l,r;
    node* root,*a,*b,*c,*d;
    scanf("%d%d%d",&n,&q,&temp);
    root=new node(temp);
    for(int i=1;i<n;i++){
        scanf("%d",&temp);
        root=merge(root,new node(temp));
    }
    while(q--){
        scanf("%d%d%d",&k,&l,&r);
        if(k==0){
            split(root,r,a,b);
            split(b,1,c,d);
            root=merge(a,d);
            split(root,l,a,b);
            root=merge(a,c);
            root=merge(root,b);
            //root->out();
            //printf("\n");
        }
        else if(k==1)printf("%d\n",find(root,1,n,l+1,r+1));
        else{
            split(root,l,a,b);
            split(b,1,c,d);
            c->val=c->top=r;
            root=merge(a,c);
            root=merge(root,d);
        }
    }
}