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 <algorithm>
#include <iostream>
#include <random>
#include <utility>
#include <vector>
namespace lc {
template <class T>
struct MinTreapListTraits {
	typedef T value_type;
	value_type operator()(const value_type &a, const value_type &b) const {
		return std::min(a, b);
	}
};
template <class Traits>
class TreapList {
public:
	typedef typename Traits::value_type value_type;
private:
	struct node_type {
		value_type value;
		value_type cache;
		unsigned int priority;
		size_t size;
		node_type *parent;
		node_type *children[2];
	};
	Traits m_traits;
	std::default_random_engine m_random;
	node_type *m_root;
	void initialize_rng(){
		std::random_device seed_generator;
		m_random.seed(seed_generator());
	}
	void initialize_node(node_type *p, const value_type &v){
		p->value = p->cache = v;
		p->priority = m_random();
		p->size = 1;
		p->parent = p->children[0] = p->children[1] = nullptr;
	}
	node_type *clone(
		const node_type *p, const node_type *parent = nullptr) const
	{
		if(p == nullptr){ return nullptr; }
		node_type *node = new node_type();
		node->value    = p->value;
		node->cache    = p->cache;
		node->priority = p->priority;
		node->size     = p->size;
		node->parent   = parent;
		node->children[0] = clone(p->children[0], node);
		node->children[1] = clone(p->children[1], node);
		return node;
	}
	void destroy(node_type *p) const {
		if(p == nullptr){ return; }
		destroy(p->children[0]);
		destroy(p->children[1]);
		delete p;
	}
	size_t size(const node_type *p) const {
		if(p == nullptr){ return 0; }
		return p->size;
	}
	const node_type *kth(const node_type *p, size_t k) const {
		if(k >= size(p)){ return nullptr; }
		if(k < size(p->children[0])){ return kth(p->children[0], k); }
		if(k == size(p->children[0])){ return p; }
		return kth(p->children[1], k - 1 - size(p->children[0]));
	}
	node_type *kth(node_type *p, size_t k) const {
		if(k >= size(p)){ return nullptr; }
		if(k < size(p->children[0])){ return kth(p->children[0], k); }
		if(k == size(p->children[0])){ return p; }
		return kth(p->children[1], k - 1 - size(p->children[0]));
	}
	node_type *refresh(node_type *p) const {
		if(p == nullptr){ return nullptr; }
		p->cache = p->value;
		if(p->children[0] != nullptr){
			p->cache = m_traits(p->children[0]->cache, p->cache);
		}
		if(p->children[1] != nullptr){
			p->cache = m_traits(p->cache, p->children[1]->cache);
		}
		p->size = 1 + size(p->children[0]) + size(p->children[1]);
		return p;
	}
	node_type *merge(node_type *l, node_type *r) const {
		if(l == nullptr){ return r; }
		if(r == nullptr){ return l; }
		if(l->priority > r->priority){
			l->children[1] = merge(l->children[1], r);
			return refresh(l);
		}else{
			r->children[0] = merge(l, r->children[0]);
			return refresh(r);
		}
	}
	std::pair<node_type *, node_type *> split(node_type *t, size_t k) const {
		if(t == nullptr){ return std::make_pair(nullptr, nullptr); }
		if(k <= size(t->children[0])){
			const auto s = split(t->children[0], k);
			t->children[0] = s.second;
			return std::make_pair(s.first, refresh(t));
		}else{
			const auto s = split(t->children[1], k - size(t->children[0]) - 1);
			t->children[1] = s.first;
			return std::make_pair(refresh(t), s.second);
		}
	}
public:
	explicit TreapList(const Traits &traits = Traits())
		: m_traits(traits)
		, m_random()
		, m_root(nullptr)
	{
		initialize_rng();
	}
	TreapList(const TreapList<Traits> &x)
		: m_traits(x.m_traits)
		, m_random()
		, m_root(nullptr)
	{
		initialize_rng();
		m_root = clone(x.m_root);
	}
	TreapList(TreapList<Traits> &&x)
		: m_traits(x.m_traits)
		, m_random(x.m_random)
		, m_root(x.m_root)
	{
		x.m_root = nullptr;
	}
	~TreapList(){ destroy(m_root); }
	size_t size() const { return size(m_root); }
	bool empty() const { return m_root == nullptr; }
	const value_type &operator[](size_t k) const {
		return kth(m_root, k)->value;
	}
	void insert(size_t k, const value_type &x){
		const auto p = split(m_root, k);
		node_type *node = new node_type();
		initialize_node(node, x);
		m_root = merge(merge(p.first, node), p.second);
	}
	void erase(size_t k){
		const auto p = split(m_root, k);
		const auto q = split(p.second, 1);
		delete q.first;
		m_root = merge(p.first, q.second);
	}
	void update(size_t k, const value_type &x){
		node_type *p = kth(m_root, k);
		p->value = x;
		while(p != nullptr){ p = refresh(p)->parent; }
	}
	value_type query(size_t l, size_t r){
		const auto p = split(m_root, l);
		const auto q = split(p.second, r - l);
		const value_type result = q.first->cache;
		m_root = merge(merge(p.first, q.first), q.second);
		return result;
	}
	void merge(const TreapList<Traits> &t){
		TreapList<Traits> temporary(t);
		merge(std::move(temporary));
	}
	void merge(TreapList<Traits> &&t){
		m_root = merge(m_root, t.m_root);
		t.m_root = nullptr;
	}
	TreapList<Traits> split(size_t k){
		TreapList<Traits> result(m_traits);
		const auto p = split(m_root, k);
		m_root = p.first;
		result.m_root = p.second;
		return result;
	}
};
}
using namespace std;
int main(){
	ios_base::sync_with_stdio(false);
	int n, q;
	cin >> n >> q;
	vector<int> a(n);
	for(int i = 0; i < n; ++i){ cin >> a[i]; }
	lc::TreapList<lc::MinTreapListTraits<int>> b;
	for(int i = 0; i < n; ++i){ b.insert(i, a[i]); }
	while(q--){
		int x, y, z;
		cin >> x >> y >> z;
		if(x == 0){
			lc::TreapList<lc::MinTreapListTraits<int>> c = b.split(y);
			lc::TreapList<lc::MinTreapListTraits<int>> d = c.split(z - y);
			lc::TreapList<lc::MinTreapListTraits<int>> e = d.split(1);
			b.merge(std::move(d));
			b.merge(std::move(c));
			b.merge(std::move(e));
		}else if(x == 1){
			cout << b.query(y, z + 1) << endl;
		}else{
			b.update(y, z);
		}
	}
	return 0;
}