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;

using T = int;
const T id = INT_MAX;
T op(T l, T r) {
	return min(l, r);
}

struct node;
node *update(node *t);

struct node {
	T val, all;
	node *ch[2];
	int dep, size;
	node() {}
	void init(T v) {
		val = all = v;
		dep = size = 1;
		ch[0] = ch[1] = nullptr;
	}
	void init(node* l, node* r) {
		val = id;
		ch[0] = l, ch[1] = r;
		update(this);
	}
};

const int pmax = 8e5;
node pool[pmax];
queue<int> deleted;
int it = 0;

int depth(node *t) { return t ? t->dep : 0; }
int count(node *t) { return t ? t->size : 0; }
int que(node *t) { return t ? t->all : id; }

node *new_leaf(T v) {
	if (!deleted.empty()) {
		auto pos = deleted.front(); deleted.pop();
		pool[pos].init(v);
		return pool + pos;
	}
	assert(it < pmax);
	pool[it].init(v);
	return pool + it++;
}

node *new_node(node *l, node *r) {
	if (!deleted.empty()) {
		auto pos = deleted.front(); deleted.pop();
		pool[pos].init(l, r);
		return pool + pos;
	}
	assert(it < pmax);
	pool[it].init(l, r);
	return pool + it++;
}

void delete_node(node* t) {
	deleted.push(t - pool);
}

node *update(node *t) {
	t->dep = max(depth(t->ch[0]), depth(t->ch[1])) + 1;
	t->all = op(que(t->ch[0]), op(t->val, que(t->ch[1])));
	t->size = count(t->ch[0]) + count(t->ch[1]) + (!t->ch[0] || !t->ch[1]);
	return t;
}

node *rotate(node *t, int b) {
	node *s = t->ch[1 - b];
	t->ch[1 - b] = s->ch[b];
	s->ch[b] = t;
	t = update(t);
	s = update(s);
	return s;
}

node *fix(node *t) {
	if (!t) return t;
	int dd = depth(t->ch[0]) - depth(t->ch[1]);
	if (abs(dd) < 2) return t;
	int b = dd < 0;
	if (depth(t->ch[b]->ch[!b]) > depth(t->ch[b]->ch[b])) {
		t->ch[b] = rotate(t->ch[b], b);
	}
	return rotate(t, !b);
}

node *merge(node *l, node *r) {
	if (!l) return r;
	if (!r) return l;
	if (l->dep == r->dep) return new_node(l, r);
	if (l->dep < r->dep) {
		r->ch[0] = merge(l, r->ch[0]);
		return fix(update(r));
	}
	l->ch[1] = merge(l->ch[1], r);
	return fix(update(l));
}

pair<node*, node*> split(node *t, int k) {
	if (!t) return make_pair(nullptr, nullptr);
	if (k == 0) return make_pair(nullptr, t);
	if (k >= count(t)) return make_pair(t, nullptr);
	int c = count(t->ch[0]);
	node *l = t->ch[0], *r = t->ch[1];
	delete_node(t);
	if (k < c) {
		pair<node*, node*> p = split(l, k);
		return make_pair(p.first, merge(p.second, r));
	}
	if (k > c) {
		pair<node*, node*> p = split(r, k - c);
		return make_pair(merge(l, p.first), p.second);
	}
	return make_pair(l, r);
}

node *insert(node *t, int k, T v) {
	pair<node*, node*> s = split(t, k);
	return merge(merge(s.first, new_leaf(v)), s.second);
}

node *erase(node *t, int k) {
	pair<node*, node*> s1 = split(t, k), s2 = split(s1.second, 1);
	return merge(s1.first, s2.second);
}

node *find(node *t, int k) {
	if (!t) return t;
	int c = count(t->ch[0]), b = (!t->ch[0] || !t->ch[1]);
	return c == 0 && b ? t : k < c ? find(t->ch[0], k) : find(t->ch[1], k - c - b);
}

T find(node *t, int l, int r) {
	if (!t) return id;
	if (r < 0 || l >= count(t)) return id;
	if (l <= 0 && r >= t->size) return t->all;
	int c = count(t->ch[0]), d = c + (!t->ch[0] || !t->ch[1]);
	return op(!t->ch[0] ? id : find(t->ch[0], l, r), op(l <= c && c < r ? t->val : id, !t->ch[1] ? id : find(t->ch[1], l - d, r - d)));
}

void update(node *t, int k, T val) {
	if (!t) return;
	int c = count(t->ch[0]), b = (!t->ch[0] || !t->ch[1]);
	if (c == 0 && b) {
		t->val = val;
	}
	else if (k < c) {
		update(t->ch[0], k, val);
	}
	else {
		update(t->ch[1], k - c - b, val);
	}
	update(t);
}

node* build(const vector<T>& a, int lb, int ub) {
	if (ub - lb == 1) return new_leaf(a[lb]);
	int m = (lb + ub) >> 1;
	return merge(build(a, lb, m), build(a, m, ub));
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	int n, q;
	cin >> n >> q;
	vector<T> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	node* root = build(a, 0, n);
	while (q--) {
		int x, y, z;
		cin >> x >> y >> z;
		if (x == 0) {
			int val = find(root, z)->val;
			root = insert(erase(root, z), y, val);
		}
		else if (x == 1) {
			printf("%d\n", find(root, y, z + 1));
		}
		else {
			update(root, y, z);
		}
	}
	return 0;
}