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++: // Randomized Binary Search Tree
// infix, 0-based

// AOJ 1508 RMQ

#include <bits/stdc++.h>
using namespace std;

template<class T, class Updater, T init>
class RBST {
private:
	static mt19937 engine;
	static Updater func;

	struct node {
		typedef node * Ptr;

		T value, res;
		int size;
		Ptr left, right;

		node(const T &v):value(v), res(v), size(1), left(nullptr), right(nullptr) {}

		inline void update() {
			size = 1;
			res = value;

			if(left) {
				size += left->size;
				res = func(res, left->res);
			}

			if(right) {
				size += right->size;
				res = func(res, right->res);
			}
		}
	};

	typedef typename RBST<T, Updater, init>::node::Ptr Ptr;
	Ptr root;

	inline static int node_size(const Ptr x) {
		return x ? x->size : 0;
	}

	Ptr merge(Ptr x, Ptr y) {
		if(!x) return y;
		if(!y) return x;

		if(engine() % (x->size + y->size) < x->size) {
			x->right = merge(x->right, y);
			x->update();
			return x;
		}
		else {
			y->left = merge(x, y->left);
			y->update();
			return y;
		}
	}

	typedef pair<Ptr , Ptr> P;

	P split(Ptr x, const int num) {
		if(!x) return P(nullptr, nullptr);

		const int l_size = node_size(x->left);
		if(l_size < num) {
			const P tmp = split(x->right, num - l_size - 1);
			x->right = tmp.first;
			x->update();
			return P(x, tmp.second);
		}
		else {
			const P tmp = split(x->left, num);
			x->left = tmp.second;
			x->update();
			return P(tmp.first, x);
		}
	}

	Ptr insert(Ptr x, const int pos, const T &value) {
		Ptr new_node(new node(value));
		const P tmp = split(x, pos);
		return merge(merge(tmp.first, new_node), tmp.second);
	}

	Ptr erase(Ptr x, const int pos) {
		P tmp = split(x, pos);
		Ptr left = tmp.first;
		tmp = split(tmp.second, 1);
		delete tmp.first;
		return merge(left, tmp.second);
	}

	// [l, r)
	T query(const Ptr x, const int l, const int r) const {
		if(!x) return init;
		if(r <= 0 || x->size <= l) return init;
		if(l <= 0 && x->size <= r) return x->res;

		const int l_size = node_size(x->left);
		const T res = (l <= l_size && l_size < r ? x->value : init);
		const T vl = query(x->left, l, r);
		const T vr = query(x->right, l - l_size - 1, r - l_size - 1);
		return func(res, func(vl, vr));
	}

public:
	RBST():root(nullptr) {}
	inline void erase(const int pos) { root = erase(root, pos); }
	inline void insert(const int pos, const T &value) { root = insert(root, pos, value); }
	inline T query(const int l, const int r) const { return query(root, l, r); }
};

template<class T, class Updater, T init> mt19937 RBST<T, Updater, init>::engine((random_device())());
template<class T, class Updater, T init> Updater RBST<T, Updater, init>::func;

template<class T>struct min_ob{inline T operator()(const T&a, const T&b)const{return min<T>(a,b);}};
template<class T> using range_minimum_query = RBST<T, min_ob<T>, numeric_limits<T>::max()>;

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	enum { SHIFT, QUERY, UPDATE };

	int n, q;
	cin >> n >> q;

	range_minimum_query<int> rmq;
	for(int i = 0; i < n; ++i) {
		int a;
		cin >> a;
		rmq.insert(i, a);
	}

	while(q--) {
		int x, y, z;
		cin >> x >> y >> z;
		switch(x) {
		case SHIFT:
		{
			const auto value = rmq.query(z, z + 1);
			rmq.erase(z);
			rmq.insert(y, value);
			break;
		}
		case QUERY:
		{
			cout << rmq.query(y, z + 1) << '\n';
			break;
		}
		case UPDATE:
		{
			rmq.erase(y);
			rmq.insert(y, z);
			break;
		}
		default: assert(false);
		}
	}

	return EXIT_SUCCESS;
}