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 <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <iterator>
#include <bitset>
#include <random>
#include <assert.h>
#include <unordered_map>
#include <array>
#include <ctime>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define X first
#define Y second
#define MP make_pair
#define umap unordered_map

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> P;
typedef unsigned int uint;

class Treap{
	struct node{
		int val, Min;
		int pri, cnt;
		node *lch, *rch;
		node(int val, int p) :val(val), Min(val), pri(p), cnt(1){
			lch = rch = nullptr;
		}
	};
	node *update(node *t){
		t->cnt = count(t->lch) + count(t->rch) + 1;
		t->Min = min({ t->val, min_elem(t->lch), min_elem(t->rch) });
		return t;
	}

	static const int INF = 1<<30;
public:
	node *root;
	Treap() :root(nullptr){}
	int count(node *t){ return t ? t->cnt : 0; };
	int min_elem(node *t){ return t ? t->Min : INF; };

	node *merge(node *l, node *r){
		if (l == nullptr) return r;
		if (r == nullptr) return l;

		if (l->pri > r->pri){
			l->rch = merge(l->rch, r);
			return update(l);
		}
		else{
			r->lch = merge(l, r->lch);
			return update(r);
		}
	}

	pair<node*, node*> split(node *t, int k){
		if (t == nullptr) return make_pair(nullptr, nullptr);

		if (k <= count(t->lch)){
			auto s = split(t->lch, k);
			t->lch = s.second;
			return make_pair(s.first, update(t));
		}
		else{
			auto s = split(t->rch, k - count(t->lch) - 1);
			t->rch = s.first;
			return make_pair(update(t), s.second);
		}
	}

	node *insert(node *t, int k, int val, int p){
		if (t == nullptr) return t = new node(val, p);

		node *l, *r;
		tie(l, r) = split(t, k);
		return t = merge(merge(l, new node(val, p)), r);
	}

	node *erase(node *t, int k){
		if (t == nullptr) return nullptr;

		node *l, *r, *m;
		tie(l, r) = split(t, k + 1);
		tie(l, m) = split(l, k);

		return t = merge(l, r);
	}

	node *get(node *t, int k){
		if (t == nullptr) return nullptr;
		int lcnt = count(t->lch);
		if (lcnt > k) return get(t->lch, k);
		if (lcnt < k) return get(t->rch, k - lcnt - 1);
		return t;
	}

	node *upd(node *t, int k, int val, int pri){		
		return insert(erase(t, k), k, val, pri);
	}

	int min_query(node *t, int l, int r){ // min{[l, r)}
		// tの範囲は[0, count(t))
		int a = 0, b = count(t);

		if (a >= b || r <= a || b <= l) return INF;
		if (l <= a && b <= r) return min_elem(t);

		int lcnt = count(t->lch);
		int lmin = min_query(t->lch, l, r);
		int rmin = min_query(t->rch, l - lcnt - 1, r - lcnt - 1);

		int res = l <= lcnt && lcnt < r ? t->val : INF;

		return min({ res, lmin, rmin });
	}

	node *right_shift(node *t, int l, int r, int p){
		int val = get(t, r - 1)->val;
		return insert(erase(t, r - 1), l, val, p);
	}

	void print(){
		_print(root);
		cout << endl;
	}
	void _print(node *t){
		if (t == nullptr) return;
		_print(t->lch);
		cout << t->val << endl;
		_print(t->rch);
	}
};

Treap t;
int main(){
	srand(time(NULL));

	int n, q;
	cin >> n >> q;
	rep(i, n){
		int x;
		cin >> x;
		t.root = t.insert(t.root, i, x, rand());
	}

	rep(i, q){
		int type, l, r;
		cin >> type >> l >> r;
		switch (type){
		case 0:
			t.root = t.right_shift(t.root, l, r + 1, rand());
			break;
		case 1:
			//cout << "***";
			cout << t.min_query(t.root, l, r + 1) << '\n';
			break;
		case 2:
			t.root = t.upd(t.root, l, r, rand());
			break;
		}

		//t.print();
		//cout << endl;
	}

	return 0;
}