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<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=(b);i>=(a);i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX



struct treap{
	struct node{
		int v;
		node *cl,*cr;
		int pri;
		int cnt;
		int minv;
		node(int iv){
			v=iv;
			minv=v;
			cnt=1;
			pri=((int)rand());
			cl=cr=NULL;
		}
	};
	
	node* root;
	treap(){
		root=NULL;
	}
	
	int get_cnt(node* t){ //( p??????[0,p)?????\??£????????????
		if(t==NULL)return 0;
		return t->cnt;
	}
	
	int get_minv(node* t){ 
		if(t==NULL)return 10000005;
		return t->minv;
	}
	
	void update(node* t){
		t->cnt=get_cnt(t->cl)+get_cnt(t->cr)+1;
		t->minv = min(t->v,min(get_minv(t->cl),get_minv(t->cr)));
	}
	
	
	node* merge(node* l,node* r){
		if(l==NULL)return r;
		else if(r==NULL)return l;
		
		node* res;
		if(l->pri<r->pri){//l??????
			res=l;
			l->cr = merge(l->cr,r);
		}
		else{//r??????
			res=r;
			r->cl = merge(l,r->cl);
		}
		update(res);
		return res;
	}
	
	typedef pair<node*,node*> nmp;
	
	nmp split(node* t,int k){ //(( [0,k),[k,n) ??§???t?????¬???
		if(t==NULL)return nmp(NULL,NULL);
		if(k<=get_cnt(t->cl)){
			nmp pa = split(t->cl,k);
			t->cl=pa.sec;
			update(t);
			return nmp(pa.fir,t);
		}
		else{
			nmp pa = split(t->cr,k-get_cnt(t->cl)-1);
			t->cr=pa.fir;
			update(t);
			return nmp(t,pa.sec);
		}
	}
	
	void insert(int iv,int k){//k?????????iv?????????
		nmp pa = split(root,k);
		
		node* t = new node(iv);
		t = merge(pa.fir,t);
		root = merge(t,pa.sec);
	}
	
	int erase(int k){//k??????????¶????(????????????)
		//pa.fir :: pb.fir (==k) :: pb.sec ??¨??????
		nmp pa = split(root,k);
		nmp pb = split(pa.sec,1);
		//printf("%d %d %d\n",get_cnt(pa.fir),get_cnt(pb.fir),get_cnt(pb.sec));
		int res=pb.fir->v;
		free(pb.fir);
		root = merge(pa.fir,pb.sec);
		return res;
	}
	
	int get_min(int l,int r){
		nmp pa =split(root,r+1);
		nmp pb =split(pa.fir,l);
		int res = get_minv(pb.sec);
		root = merge(merge(pb.fir,pb.sec),pa.sec);
		return res;
	}
	
	void shift(int l,int r){
		int rn=erase(r);
		insert(rn,l);
	}
	
	void chnum(int k,int iv){
		erase(k);
		insert(iv,k);
	}
	
	void out(node* t,int dep){
		if(t==NULL)return;
		out(t->cl,dep+1);
		rep(i,dep)printf("  ");
		printf("(%x v. %d minv. %d cnt. %d cl. %x cr. %x pri. %d)\n",t,t->v,t->minv,t->cnt,t->cl,t->cr,t->pri);
		out(t->cr,dep+1);
	}
	
	void out(){
		out(root,0);
	}
};


int main(void){
	srand(1234);
	
	treap tr;
	int n,iq;
	scanf("%d%d",&n,&iq);
	rep(i,n){
		int a;
		scanf("%d",&a);
		tr.insert(a,i);
	}
	
	//tr.out();
	//return 0;
	
	rep(i,iq){
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		if(a==0){
			tr.shift(b,c);
		}
		else if(a==1){
			int p=tr.get_min(b,c);
			printf("%d\n",p);
		}
		else{
			tr.chnum(b,c);
		}
	}
	
	
	return 0;
}