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++: #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;

#define int long long

#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,x,...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i, 0, n)
#define rep(...) CHOOSE((__VA_ARGS__,REP1,REP2,REP3))(__VA_ARGS__)
#define rrep(i, s) rep(i, s, >= 0, --)

#define all(c) begin(c), end(c)
template<typename T>bool maxup(T& a, T&& b) { if (a < b) { a = b; return true; }; }
template<typename T>bool maxup(T& a, T& b) { if (a < b) { a = b; return true; }; }
template<typename T>bool minup(T& a, T&& b) { if (a > b) { a = b; return true; }; }
template<typename T>bool minup(T& a, T& b) { if (a > b) { a = b; return true; }; }

#define X first
#define Y second

using VV = vector<vector<int>>;
using V = vector<int>;
using P = pair<int, int>;
using IP = pair<int, P>;

template<typename T>
inline void input(vector<T>& v) { for (auto& x : v) cin >> x; }
struct node_t {
	int val;
	int pri;
	int cnt;
	int min;
	node_t *lch, *rch;
};

int count(node_t *t) { return !t ? 0 : t->cnt; }
int min(node_t *t) { return !t ? (1 << 29) : t->min; }
node_t* update(node_t *t) {
	t->cnt = count(t->lch) + count(t->rch) + 1;
	t->min = min(t->val, min(min(t->lch), min(t->rch)));
	return t;
}

node_t *merge(node_t *l, node_t *r) {
	if (!l || !r) return l ? l : r;

	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_t*, node_t*> split(node_t *t, int k) {
	if (!t) 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_t* insert(node_t *t, int k, int v) {
	auto n = new node_t{ v, rand(), 1, v };
	if (!t) return n;
	auto x = split(t, k);
	return merge(merge(x.first, n), x.second);
}

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

node_t* kth(node_t *t, int k) {
	if (!t || count(t->lch) == k) return t;
	return count(t->lch) > k ? kth(t->lch, k)
		: kth(t->rch, k - count(t->lch) - 1);
}

int min(node_t *t, int l, int r) { //[l, r)
	if (!t || (l == 0 && count(t) <= r)) return min(t);

	int lc = count(t->lch);
	int ret = min(t->lch, l, r);
	minup(ret, min(t->rch, l - lc - 1, r - lc - 1));
	if (l <= lc && lc < r) {
		minup(ret, t->val);
	}
	return ret;
}

using Tree = node_t*;

void get_all(node_t *t, vector<node_t*>& res) {
	if (!t) return;
	get_all(t->lch, res);
	res.push_back(t);
	get_all(t->rch, res);
}

vector<node_t*> get_all(node_t *t) {
	vector<node_t*> v;
	get_all(t, v);
	return v;
}

void dump(node_t* t) {
	return;
	if (!t) return;
	cout << "top: (" << t->val << ", " << t->min << "), count: " << count(t) << endl;
	for (auto x : get_all(t)) {
		cout << "  " << (x->val) << " " << x->min << endl;
	}
}

signed main() {
	int n, q;
	scanf("%lld %lld", &n, &q);
	Tree t = nullptr;
	rep(i, n) {
		int a;
		scanf("%lld", &a);
		dump(t);
		t = insert(t, count(t), a);
	}
	dump(t);
	rep(i, q) {
		int x, y, z;
		scanf("%lld %lld %lld", &x, &y, &z);
		if (x == 0) {
			auto tmp = kth(t, z);
			t = erase(t, z);
			dump(t);
			t = insert(t, y, tmp->val);
			dump(t);
		}
		if (x == 1) {
			printf("%lld\n" , min(t, y, z + 1));
		}
		if (x == 2) {
			t = erase(t, y);
			t = insert(t, y, z);
		}
		dump(t);
	}

	//system("pause");
}