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);
}

using COL = bool;
const COL RED = false, BLACK = true;

struct node {
	COL color;
	int size;
	int level;
	T val, all;
	node *p, *ch[2];
	node() : color(BLACK), size(0), level(0), val(id), all(id), p(nullptr), ch{ nullptr, nullptr } {}
	node(COL c, T v, node *par, node *l, node *r) : color(c), size(1), level(0), val(v), all(v), p(par), ch{ l, r } {}
};

node* const NIL = new node();

node* new_node(T val) {
	return new node(RED, val, NIL, NIL, NIL);
}
void update(node *x) {
	x->size = x->ch[0]->size + 1 + x->ch[1]->size;
	x->level = x->ch[0]->level + (x->color == BLACK);
	x->all = op(op(x->ch[0]->all, x->val), x->ch[1]->all);
}
void update(node *root, node *x) {
	while (x != NIL) update(x), x = x->p;
}
void rotate(node *&root, node *x, int b) {
	node *y = x->ch[1 - b];
	x->ch[1 - b] = y->ch[b];
	if (y->ch[b] != NIL) {
		y->ch[b]->p = x;
	}
	y->p = x->p;
	if (x->p == NIL) {
		root = y;
	}
	else {
		x->p->ch[x != x->p->ch[0]] = y;
	}
	y->ch[b] = x;
	x->p = y;
	update(x);
	update(y);
}
void insert_fix(node *&root, node *x) {
	while (x->p->color == RED) {
		int b = (x->p != x->p->p->ch[0]);
		node *y = x->p->p->ch[1 - b];
		if (y->color == RED) {
			x->p->color = BLACK;
			y->color = BLACK;
			x->p->p->color = RED;
			x = x->p->p;
			continue;
		}
		if (x == x->p->ch[1 - b]) {
			x = x->p;
			rotate(root, x, b);
		}
		x->p->color = BLACK;
		x->p->p->color = RED;
		rotate(root, x->p->p, 1 - b);
	}
	root->color = BLACK;
}
void transplant(node *&root, node *u, node *v) {
	if (u->p == NIL) {
		root = v;
	}
	else {
		u->p->ch[u != u->p->ch[0]] = v;
	}
	v->p = u->p;
}
void erase_fix(node *&root, node *x) {
	while (x != root && x->color == BLACK) {
		int b = (x != x->p->ch[0]);
		node *w = x->p->ch[1 - b];
		if (w->color == RED) {
			w->color = BLACK;
			x->p->color = RED;
			rotate(root, x->p, b);
			w = x->p->ch[1 - b];
		}
		if (w->ch[b]->color == BLACK && w->ch[1 - b]->color == BLACK) {
			w->color = RED;
			x = x->p;
			continue;
		}
		if (w->ch[1 - b]->color == BLACK) {
			w->ch[b]->color = BLACK;
			w->color = RED;
			rotate(root, w, 1 - b);
			w = x->p->ch[1 - b];
		}
		w->color = x->p->color;
		x->p->color = BLACK;
		w->ch[1 - b]->color = BLACK;
		rotate(root, x->p, b);
		x = root;
	}
	x->color = BLACK;
}
node* find_first(node *x) {
	if (x == NIL) return NIL;
	while (x->ch[0] != NIL) x = x->ch[0];
	return x;
}
node* find(node *&root, int k) {
	if (k < 0 || root->size <= k) return NIL;
	node *x = root;
	while (x->ch[0]->size != k) {
		if (k < x->ch[0]->size) {
			x = x->ch[0];
		}
		else {
			k -= x->ch[0]->size + 1;
			x = x->ch[1];
		}
	}
	return x;
}
void insert(node *&root, int k, T val) {
	node *y = NIL, *v = new_node(val);
	if (root == NIL) {
		root = v;
	}
	else if (k == 0) {
		y = find_first(root);
		y->ch[0] = v;
	}
	else {
		y = find(root, k - 1);
		if (y->ch[1] == NIL) {
			y->ch[1] = v;
		}
		else {
			y = find_first(y->ch[1]);
			y->ch[0] = v;
		}
	}
	v->p = y;
	update(root, y);
	insert_fix(root, v);
}
void erase(node *&root, node *x) {
	if (x == NIL) return;
	node *y = x, *z;
	COL c = y->color;
	if (x->ch[0] == NIL) {
		z = x->ch[1];
		transplant(root, x, x->ch[1]);
	}
	else if (x->ch[1] == NIL) {
		z = x->ch[0];
		transplant(root, x, x->ch[0]);
	}
	else {
		y = find_first(x->ch[1]);
		c = y->color;
		z = y->ch[1];
		if (y->p == x) {
			z->p = y;
		}
		else {
			transplant(root, y, y->ch[1]);
			y->ch[1] = x->ch[1];
			y->ch[1]->p = y;
		}
		transplant(root, x, y);
		y->ch[0] = x->ch[0];
		y->ch[0]->p = y;
		y->color = x->color;
		update(y);
	}
	update(root, z->p);
	if (c == BLACK) {
		erase_fix(root, z);
	}
}
void erase(node *&root, int k) {
	node *x = find(root, k);
	erase(root, x);
}
T find(node *t, int l, int r) {
	if (t == NIL || r <= 0 || t->size <= l) return id;
	if (l <= 0 && t->size <= r) return t->all;
	T res = id;
	res = op(res, find(t->ch[0], l, r));
	int c = t->ch[0]->size;
	if (l <= c && c < r) res = op(res, t->val);
	res = op(res, find(t->ch[1], l - (c + 1), r - (c + 1)));
	return res;
}

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