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>
#include <cassert>
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;
int INF = INT_MAX / 2;

struct Splay {
	Splay *lch, *rch;
	int d, val;
	Splay(int _val = 0) : lch(0), rch(0), d(1), val(_val) {}
};
typedef pair<Splay*, Splay*> P;

Splay* update(Splay* x) {
	x->d = x->lch->d + x->rch->d;
	x->val = min(x->lch->val, x->rch->val);
	return x;
}

Splay* rotr(Splay* x) {
	Splay* y = x->lch;
	x->lch = y->rch;
	y->rch = x;
	update(x);
	return update(y);
}

Splay* rotl(Splay* x) {
	Splay* y = x->rch;
	x->rch = y->lch;
	y->lch = x;
	update(x);
	return update(y);
}

/*
void propagate(Splay* x) {
	x->lch->dval += x->dval;
	x->rch->dval += x->dval;
	x->dval = 0;
}
*/

Splay* splay(Splay* x, int m) {
	if (m == 0 || m == x->d) return x;
	int d1 = x->lch->d;
	if (m < d1) {
		int d2 = x->lch->lch->d;
		if (m < d2) {
			x->lch->lch = splay(x->lch->lch, m);
			return rotr(rotr(x));
		}
		else if (m > d2) {
			x->lch->rch = splay(x->lch->rch, m - d2);
			x->lch = rotl(x->lch);
			return rotr(x);
		}
		else {
			x->lch = splay(x->lch, m);
			return rotr(x);
		}
	}
	else if (m > d1) {
		int d2 = x->rch->lch->d;
		if (m < d1 + d2) {
			x->rch->lch = splay(x->rch->lch, m - d1);
			x->rch = rotr(x->rch);
			return rotl(x);
		}
		else if (m > d1 + d2) {
			x->rch->rch = splay(x->rch->rch, m - d1 - d2);
			return rotl(rotl(x));
		}
		else {
			x->rch = splay(x->rch, m - d1);
			return rotl(x);
		}
	}
	else return x;
}

Splay* merge(Splay* x, Splay* y) {
	if (!x) return y;
	if (!y) return x;
	Splay* z = new Splay();
	z->lch = x;
	z->rch = y;
	return update(z);
}

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

P split(Splay* x, int m) {
	if (m == 0) return P(NULL, x);
	if (m == x->d) return P(x, NULL);
	x = splay(x, m);
	P p(x->lch, x->rch);
	delete x;
	return p;
}

vector<Splay*> splits(Splay* x, vector<int> is) {
    reverse(is.begin(), is.end());
    vector<Splay*> 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(Splay*& x, int i) {
	P p = split(x, i);
	cout << p.second->d << endl;
	P q = split(p.second, 1);
	cout << q.first << endl;
	int val = q.first->val;
	x = merge(p.first, merge(q.first, q.second));
	return val;
}

int main() {
	int N, Q; cin >> N >> Q;
	vector<int> a(N);
	rep(i, N) scanf("%d", &a[i]);
	Splay* x = NULL;
	rep(i, N) x = merge(x, new Splay(a[i]));
	while (Q--) {
		int q; scanf("%d", &q);
		if (q == 0) {
			int l, r; scanf("%d%d", &l, &r); r++;
			vector<Splay*> 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++;
			vector<Splay*> xs = splits(x, { l, r });
			int val = xs[1]->val;
			x = merges(xs);
			printf("%d\n", val);
		}
		if (q == 2) {
			int i, val; scanf("%d%d", &i, &val);
			vector<Splay*> xs = splits(x, { i, i + 1 });
			xs[1]->val = val;
			x = merges(xs);
		}
	}
}