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;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        auto i = vs.begin();
        os << "[" << *i;
        for (++i; i != vs.end(); ++i) os << " " << *i;
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    const int INF = INT_MAX / 2;

    template<class V> struct Treap {
        mt19937 mt;
        Treap() : root(NULL) {
            random_device rnd;
            mt.seed(rnd());
        }

        struct Node {
            V value;
            Node *left, *right;
            int priority;
            int size;
            V res;
            Node(V value, int priority) : value(value), priority(priority), size(1), res(value) {
                left = NULL;
                right = NULL;
            }
        };

        Node *root;
        int size(Node *t) {
            if (t == NULL) return 0;
            return t->size;
        }

        V res(Node *t) {
            if (t == NULL) return INF;
            V l = (t->left == NULL ? INF : t->left->res);
            V r = (t->right == NULL ? INF : t->right->res);
            return min(l, min(t->value, r));
        }

        Node* update(Node *v) {
            v->size = size(v->left) + size(v->right) + 1;
            v->res = min(res(v->left), min(v->value, res(v->right)));
            return v;
        }

        Node* merge(Node *l, Node *r) {
            if (l == NULL) return r;
            if (r == NULL) return l;
            assert(l != NULL && r != NULL);

            if (l->priority > r->priority) {
                l->right = merge(l->right, r);
                return update(l);
            } else {
                r->left = merge(l, r->left);
                return update(r);
            }
        }

        pair<Node*, Node*> split(Node *t, int k) { // [0, k) ??¨ [k, n)?????????
            if (t == NULL) return make_pair((Node*)NULL, (Node*)NULL);
            if (k <= size(t->left)) {
                auto s = split(t->left, k);
                t->left = s.second;
                return make_pair(s.first, update(t));
            } else {
                auto s = split(t->right, k - size(t->left) - 1); // ??????-1?????????????????¨?????¨???root(?????????t)??????
                t->right = s.first;
                return make_pair(update(t), s.second);
            }
        }
        pair<Node*, Node*> split(int k) { return split(root, k); }

        Node* insert(Node *t, int k, V value) {
            auto x = split(t, k);
            auto y = split(x.second, 1);
            return merge(x.first, merge(new Node(value, mt()), y.second));
        }
        Node* insert(int k, V value) { return root = insert(root, k, value); }

        Node* erase(Node *t, int k) {
            auto x = split(t, k);
            auto y = split(x.second, 1);
            return merge(x.first, y.second);
        }
        Node* erase(int k) { return root = erase(root, k); }

        Node* find(Node *t, int k) {
            auto x = split(t, k);
            auto y = split(x.second, 1);
            Node *ret = y.first;
            merge(x.first, merge(y.first, y.second));
            return ret;
        }
        Node* find(int k) { return find(root, k); }
    };

    void solve() {
        int N, Q; cin >> N >> Q;
        Treap<int> t;
        for (int i = 0; i < N; i++) {
            int a; cin >> a;
            t.insert(i, a);
        }
        for (int q = 0; q < Q; q++) {
            int x, y, z; cin >> x >> y >> z;
            if (x == 0) {
                z++;
                auto a = t.split(t.root, y);
                auto b = t.split(a.second, z - y);
                auto v = b.first;
                auto p = t.split(v, z - y - 1);
                auto nv = t.merge(p.second, p.first);
                t.merge(a.first, t.merge(nv, b.second));
            } else if (x == 1) {
                z++;
                auto a = t.split(t.root, y);
                auto b = t.split(a.second, z - y);
                auto v = b.first;
                cout << t.res(v) << endl;
                t.merge(a.first, t.merge(b.first, b.second));
            } else {
                assert(x == 2);
                t.insert(y, z);
            }
            //for (int i = 0; i < N; i++) { cout << t.find(i)->value << " "; } cout << endl;
        }
    }
}

int main() {
    solve();
    return 0;
}