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 _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<int, ll> i_ll;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v; ll w; };

const int MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
ll INF = LLONG_MAX / 3;

struct dice {
	mt19937 mt;
	dice() {
		random_device rd;
		mt = mt19937(rd());
	}
	int operator()(int x) { return this->operator()(0, x - 1); }
	int operator()(int x, int y) {
		uniform_int_distribution<int> dist(x, y);
		return dist(mt);
	}
} dc;

struct rbst {
	rbst *lch, *rch;
	int sz;
	int val, mi;
	rbst(int _val) : lch(NULL), rch(NULL), sz(1), val(_val), mi(_val) {}
};
typedef pair<rbst*, rbst*> P;

int sz(rbst* x) { return x ? x->sz : 0; }
int mi(rbst* x) { return x ? x->mi : INT_MAX; }

rbst* update(rbst* x) {
	x->sz = 1 + sz(x->lch) + sz(x->rch);
	x->mi = min(x->val, min(mi(x->lch), mi(x->rch)));
	return x;
}

rbst* merge(rbst* x, rbst* y) {
	if (!x) return y;
	if (!y) return x;
	if (dc(x->sz + y->sz) < x->sz) {
		x->rch = merge(x->rch, y);
		return update(x);
	}
	else {
		y->lch = merge(x, y->lch);
		return update(y);
	}
}

rbst* merges(vector<rbst*> xs) {
	rbst* x = NULL;
	for (rbst* y: xs) x = merge(x, y);
	return x;
}

P split(rbst* x, int i) {
	if (!x) return P();
	if (i <= sz(x->lch)) {
		P p = split(x->lch, i);
		x->lch = p.second;
		return P(p.first, update(x));
	}
	else {
		P p = split(x->rch, i - sz(x->lch) - 1);
		x->rch = p.first;
		return P(update(x), p.second);
	}
}

vector<rbst*> splits(rbst* x, vector<int> is) {
	reverse(is.begin(), is.end());
	vector<rbst*> xs;
	for (int i: is) {
		P p = split(x, i);
		x = p.first;
		xs.pb(p.second);
	}
	xs.pb(x);
	reverse(xs.begin(), xs.end());
	return xs;
}

int get_val(rbst* x, int i) {
	int lsz = sz(x->lch);
	if (i < lsz) return get_val(x->lch, i);
	else if (i > lsz) return get_val(x->rch, i - lsz - 1);
	else return x->val;
}

void set_val(rbst* x, int i, int val) {
	int lsz = sz(x->lch);
	if (i < lsz) set_val(x->lch, i, val);
	else if (i > lsz) set_val(x->rch, i - lsz - 1, val);
	else x->val = val;
	update(x);
}

int get_mi(rbst* x, int l, int r) {
	if (!x || r < 0 || x->sz <= l) return INT_MAX;
	if (l <= 0 && x->sz <= r) return x->mi;
	int lsz = sz(x->lch), mi = INT_MAX;
	if (l <= lsz && lsz < r) mi = x->val;
	mi = min(mi, get_mi(x->lch, l, r));
	mi = min(mi, get_mi(x->rch, l - lsz - 1, r - lsz - 1));
	return mi;
}

int lower_bound(rbst* x, int val) {
	if (!x) return 0;
	if (val <= x->val) return lower_bound(x->lch, val);
	else return sz(x->lch) + 1 + lower_bound(x->rch, val);
}

rbst* build(int l, int r, vector<int>& a) {
	if (l == r) return NULL;
	int m = (l + r) / 2;
	rbst* x = new rbst(a[m]);
	x->lch = build(l, m, a);
	x->rch = build(m + 1, r, a);
	return update(x);
}

int main() {
	int N, Q; cin >> N >> Q;
	vector<int> a(N);
	rep(i, N) scanf("%d", &a[i]);
	rbst* x = build(0, N, a);
	while (Q--) {
		int q; scanf("%d", &q);
		if (q == 0) {
			int l, r; scanf("%d%d", &l, &r); r++;
			vector<rbst*> xs = splits(x, {l, r - 1, r});
			swap(xs[1], xs[2]);
			x = merges(xs);
		}
		if (q == 1) {
			int l, r; scanf("%d%d", &l, &r); r++;
			printf("%d\n", get_mi(x, l, r));
		}
		if (q == 2) {
			int i, val; scanf("%d%d", &i, &val);
			set_val(x, i, val);
		}
	}
}