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"
using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>

struct Node {
        Node *l, *r, *par;
        int size;
        //頂点の情報
        ll value;
        ll minimum = INF;
        Node(){
            l = nullptr;
            r = nullptr;
            par = nullptr;
            size = 1;
        }
        bool is_root(){
            return !par or (par->l != this and par->r != this);
        }
    };
struct SplayTree{
    Node *dat, *root;
    SplayTree(int n){
        dat = new Node[n];
    }
    void connect(int n){//size nの配列
        REP(i, n){
            dat[i + 1].l = &dat[i];
            dat[i].par = &dat[i + 1];
        }
        REP(i, n + 1) update(&dat[i]);
        root = &dat[n];
    }
     void connect(vector<ll> s){//size nの配列
        int n = s.size();
        REP(i, n){
            dat[i + 1].l = &dat[i];
            dat[i].par = &dat[i + 1];
            dat[i].value = s[i];
        }
        REP(i, n + 1) update(&dat[i]);
        root = &dat[n];
     }
    void update(Node *me){//情報の更新
        me->size = 1;
        if (me->l) me->size += me->l->size;
        if (me->r) me->size += me->r->size;

        me->minimum = me->value;
        if (me->l) me->minimum = min(me->minimum, me->l->minimum);
        if (me->r) me->minimum = min(me->minimum, me->r->minimum);
    };
    void rotate(Node* me){
        Node *p, *pp, *c;
        p = me->par;
        pp = p->par;
        if(p->l == me){
            c = me->r; p->l = c; me->r = p;
        }
        else{
            c = me->l; p->r = c; me->l = p;
        }
        if (pp and pp->l == p) pp->l = me;
        if (pp and pp->r == p) pp->r = me;
        me->par = pp; p->par = me;
        if (c) c->par = p;
        update(p); update(me);
    };
    int state(Node *me){
    if (!me->par) return 0;
    if (me->par->l == me) return 1;
    if (me->par->r == me) return -1;
    return 0;
    }
    void splay(Node *me){
        while(state(me) != 0){
            if (state(me->par) == 0) {
                rotate(me);
            }
            else if (state(me) == state(me->par)){
                rotate(me->par); rotate(me);
            }
            else{
                rotate(me); rotate(me);
            }
        }
    };
    Node* get(int index, Node* croot){
            Node *now = croot;
            while(1){
                int lsize = (now->l ? now->l->size : 0);
                if (index == lsize) {
                    splay(now);
                    root = now;
                    return now;
                }
                if (index < lsize) {
                    now = now->l;
                }
                if (index > lsize) {
                    now = now->r;
                    index = index - lsize - 1;
                }
            }
    }
    Node* get(int index){
        return root = get(index, root);
    }
    Node* merge(Node* lroot, Node* rroot){
        if (!lroot) return rroot;
        if (!rroot) return lroot;
        lroot = get(lroot->size - 1, lroot);
        lroot->r = rroot;
        rroot->par = lroot;
        update(lroot);
        return lroot;
    }
    pair<Node*, Node*> split(int index, Node* croot){
        if (index == 0) return {nullptr, croot};
        if (index == croot->size) return {croot, nullptr};
        croot = get(index, croot);
        Node *lroot, *rroot;
        lroot = croot->l;
        rroot = croot;
        lroot->par = nullptr;
        rroot->l = nullptr;
        update(rroot);
        return {lroot, rroot};
    }
    Node* insert(int index, Node* x, Node* croot){
        Node *lroot, *rroot;
        auto lrroot = split(index, croot);
        lroot = lrroot.first, rroot = lrroot.second;
        return merge(merge(lroot, x), rroot);
    }
    Node* insert(int index, Node* x){
        return root = insert(index, x, root);
    }
    pair<Node*, Node*> remove(int index, Node* croot){
        croot = get(index, croot);
        Node *lroot, *rroot;
        lroot = croot->l, rroot = croot->r;
        if(lroot) lroot->par = nullptr;
        if(rroot) rroot->par = nullptr;
        croot->l = nullptr;
        croot->r = nullptr;
        update(croot);
        return {merge(lroot, rroot), croot};
    }
    pair<Node*, Node*> remove(int index){//root, removed
        auto res = remove(index, root);
        root = res.first;
        return res;
    }
    Node query(int l, int r){ //[l, r] 注意!!!!!!
        Node *lroot, *rroot, *croot, res;
        auto now = split(r + 1, root);
        rroot = now.second;
        now = split(l, now.first);
        croot = now.second;
        lroot = now.first;
        res = *croot;
        root = merge(merge(lroot, croot), rroot);
        return res;
    }
};

SplayTree tree(210000);
int main() {
    ll n, q;
    cin >> n >> q;
    vector<ll> s(n);
    REP(i, n)cin >> s[i];
    tree.connect(s);
    REP(i, q){
        ll t;
        cin >> t;
        if(t == 0){
            ll l, r;
            cin >> l >> r;
            Node *rnode = tree.remove(r).second;
            tree.insert(l, rnode);
        }
        if(t == 1){
            ll l, r;
            cin >> l >> r;
            Node res = tree.query(l, r);
            cout << res.minimum << endl;
        }
        if(t == 2){
            ll a, x;
            cin >> a >> x;
            Node *now = tree.get(a);
            now->value = x;
        }
    }
}