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 <iostream>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <complex>
#include <random>

using namespace std;
typedef long long ll;

struct AA {
//	using NP = AA*;
	typedef AA* NP;
	int mi;
	NP l, r;
	int sz, lv;
	AA(int mi) : l(nullptr), r(nullptr), sz(1), lv(0), mi(mi) {}
	AA(NP l, NP r, int lv) : l(l), r(r), lv(lv) {
		update();
	}
	void update() {
		sz = l->sz + r->sz;
		mi = min(l->mi, r->mi);
	}

	static void set(NP n, int k, int x) {
		if (n->sz == 1) {
			n->mi = x;
			return;
		}
		if (k < n->l->sz) {
			set(n->l, k, x);
		} else {
			set(n->r, k - n->l->sz, x);
		}
		n->update();
	}
	static NP skew(NP n) {
		if (n->l == nullptr || n->lv != n->l->lv) return n;
		NP L = n->l;
		n->l = L->r;
		n->update();
		L->r = n;
		L->update();
		return L;
	}
	static NP pull(NP n) {
		if (n->r == nullptr || n->lv != n->r->lv) return n;
		if (n->r->r == nullptr || n->lv != n->r->r->lv) return n;
		NP R = n->r;
		n->r = R->l;
		n->update();
		R->l = n;
		R->lv++;
		R->update();
		return R;
	}
	static NP merge(NP l, NP r) {
		if (l == nullptr) return r;
		if (r == nullptr) return l;
		if (l->lv == r->lv) {
			return new AA(l, r, l->lv+1);
		}
		if (l->lv < r->lv) {
			r->l = merge(l, r->l);
			r->update();
			return pull(skew(r));
		} else {
			l->r = merge(l->r, r);
			l->update();
			return pull(skew(l));
		}
	}
	static pair<NP, NP> split(NP n, int k) {
		if (n == nullptr) return pair<NP, NP>(nullptr, nullptr);
		if (n->sz == 1) {
			if (k == 0) return pair<NP, NP>(nullptr, n);
			else return pair<NP, NP>(n, nullptr);
		}
		pair<NP, NP> m;
		if (k <= n->l->sz) {
			m = split(n->l, k);
			m.second = merge(m.second, n->r);
		} else {
			m = split(n->r, k - n->l->sz);
			m.first = merge(n->l, m.first);
		}
		delete n;
		return m;
	}
	static NP insert(NP n, int k, NP m) {
		if (n == nullptr) return m;
		if (n->sz == 1) {
			if (k == 0) return new AA(m, n, 1);
			else return new AA(n, m, 1);
		}
		if (k <= n->l->sz) {
			n->l = insert(n->l, k, m);
			n->update();
			return pull(skew(n));
		} else {
			n->r = insert(n->r, k - n->l->sz, m);
			n->update();
			return pull(skew(n));
		}
	}
	static NP remove(NP n, int k) {
		if (n->sz == 1) {
			delete n;
			return nullptr;
		}
		NP m;
		if (k < n->l->sz) {
			m = merge(remove(n->l, k), n->r);
		} else {
			m = merge(n->l, remove(n->r, k - n->l->sz));
		}
		delete n;
		return m;
	}
};

int main() {
	int n, q;
	scanf("%d %d", &n, &q);
	AA* tr = nullptr;
	for (int i = 0; i < n; i++) {
		int a;
		scanf("%d", &a);
		tr = AA::merge(tr, new AA(a));
	}
	for (int i = 0; i < q; i++) {
		int x, y, z;
		scanf("%d %d %d", &x, &y, &z);
		if (x == 0) {
			auto m1 = AA::split(tr, z+1);
			auto m2 = AA::split(m1.first, z);
			auto m3 = AA::split(m2.first, y);
			tr = AA::merge(AA::merge(AA::merge(
					m3.first,
					m2.second),
					m3.second),
					m1.second);
		} else if (x == 1) {
			auto m1 = AA::split(tr, z+1);
			auto m2 = AA::split(m1.first, y);
			printf("%d\n", m2.second->mi);
			tr = AA::merge(AA::merge(m2.first, m2.second), m1.second);
		} else {
			AA::set(tr, y, z);
		}
	}
    return 0;
}