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;

typedef long long ll;
typedef pair<int, int> pr;
typedef tuple<int, int, int> tp;

#define lp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) lp(i, 0, n)
#define rlp(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define rrep(i, n) rlp(i, 0, n)
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(c) begin(c), end(c)
#define chmin(a, b) (a = min(a, b))
#define chmax(a, b) (a = max(a, b))

const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
const int INF = 1 << 28;
// const ll INF = 1ll << 60;
const int MOD = 1e9 + 7;

template<typename T>
class randomized_binary_search_tree {
public:
	struct node {
		node(T val): val(val), min(val), size(1){}
		T val, min;
		node *lch, *rch;
		size_t size;
	};
	
	randomized_binary_search_tree(): root(nullptr){}
	
	size_t size(){
		return size(root);
	}

	void insert(size_t k, T val){
		root = insert(root, k, val);
	}

	void erase(size_t k){
		root = erase(root, k);
	}

	node *find(size_t k){
		node *v = root;
		while (v){
			size_t s = size(v->lch);
			if (s == k) return v;
			if (s < k) v = v->lch;
			else {
				v = v->rch;
				k -= s + 1;
			}
		}
		return v;
	}
	
private:
	size_t size(node *t){
		return !t ? 0 : t->size;
	}

	T min(node *t){
		return !t ? 1001001001 : t->min;
	}

	node *update(node *t){
		t->size = size(t->lch) + size(t->rch) + 1;
		t->min = ::min({min(t->lch), min(t->rch), t->val});
		return t;
	}

	node *merge(node *s, node *t){
		if (!s) return t;
		if (!t) return s;
		if (size(s) < rand() % (size(s) + size(t))){
			s->rch = merge(s->rch, t);
			return update(s);
		}
		else {
			t->lch = merge(s, t->lch);
			return update(t);
		}
	}

	pair<node*, node*> split(node *t, size_t k){
		if (!t) return make_pair(nullptr, nullptr);
		if (k <= size(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 - size(t->lch) - 1);
			t->rch = s.first;
			return make_pair(update(t), s.second);
		}
	}

	node *insert(node *t, size_t k, T val){
		auto s = split(t, k);
		t = merge(s.first, new node(val));
		t = merge(t, s.second);
		return update(t);
	}

	node *erase(node *t, size_t k){
		pair<node*, node*> u, v;
		u = split(t, k + 1);
		v = split(u.first, k);
		t = merge(v.first, u.second);
		return update(t);
	}

	node *root;

public:
	void query0(size_t l, size_t r){
		auto a = split(root, l);
		auto b = split(a.second, r - l - 1);
		auto c = split(b.second, 1);
		auto t = merge(a.first, c.first);
		t = merge(t, b.first);
		t = merge(t, c.second);
		root = t;
	}
	
	T query1(size_t l, size_t r){
		return query1(l, r, root, 0, size());
	}

	T query1(size_t l, size_t r, node *t, size_t a, size_t b){
		if (r <= a || b <= l) return 1001001001;
		if (l <= a && b <= r) return min(t);
		return ::min({
			t->val,
			query1(l, r, t->lch, a, a + size(t->lch)),
			query1(l, r, t->rch, a + size(t->lch) + 1, b)
		});
	}

	void query2(size_t p, T v){
		erase(p);
		insert(p, v);
	}
};

typedef randomized_binary_search_tree<int> rbst_t;

int n, q;
int a[200010];
int x[200010], y[200010], z[200010];
rbst_t t;

int main()
{
	cin >> n >> q;
	rep(i, n) cin >> a[i];
	rep(i, q) cin >> x[i] >> y[i] >> z[i];
	
	rep(i, n) t.insert(i, a[i]);
	rep(i, q){
		if (x[i] == 0) t.query0(y[i], z[i] + 1);
		if (x[i] == 1) cout << t.query1(y[i], z[i] + 1) << endl;
		if (x[i] == 2) t.query2(y[i], z[i]);
	}
}