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<bits/stdc++.h>
using namespace std;

//#define USING_LONG_LONG
#ifdef USING_LONG_LONG
    #define int long long
    const int INF=1001001001001001001ll;
#else
    const int INF=1001001001;
#endif

#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define RREP(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define clr(a) memset((a),0,sizeof(a))
#define CLR(a) memset((a),-1,sizeof(a))
#define each(i,v) for(__typeof((v).begin()) i=(v).begin();i!=(v).end();i++)
#define minv(a,b) (a)=min((a),(b))
#define maxv(a,b) (a)=max((a),(b))
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef vector<string>vs;
typedef pair<int,int>pii;
#define fi first
#define se second

const int SQ=400;
struct latte{
    vi v;
    int m;
    latte(){v.clear();m=INF;}
};

int N,Q;
vector<latte>li;
int a[200000];

void build(){
    li.clear();
    latte now;
    rep(i,N){
        now.v.pb(a[i]);
        minv(now.m,a[i]);
        if(i%SQ==SQ-1){li.pb(now);now=latte();}
    }
    if(now.v.size())li.pb(now);
}

signed main(){
    scanf("%d%d",&N,&Q);
    rep(i,N)scanf("%d",&a[i]);

    build();

    rep(qry,Q){
        int type;scanf("%d",&type);
        if(type==0){
            int l,r;scanf("%d%d",&l,&r);
            int cur=0,val;
            rep(i,li.size()){
                if(cur<=r&&r<cur+li[i].v.size()){
                    val=li[i].v[r-cur];
                    for(int j=r-cur+1;j<li[i].v.size();j++){
                        li[i].v[j-1]=li[i].v[j];
                    }
                    li[i].v.pop_back();
                    li[i].m=INF;
                    rep(j,li[i].v.size())minv(li[i].m,li[i].v[j]);
                    break;
                }
                cur+=li[i].v.size();
            }
            cur=0;
            rep(i,li.size()){
                if(cur<=l&&l<cur+li[i].v.size()){
                    li[i].v.pb(0);
                    for(int j=li[i].v.size()-1;j>l-cur;j--){
                        li[i].v[j]=li[i].v[j-1];
                    }
                    li[i].v[l-cur]=val;
                    li[i].m=INF;
                    rep(j,li[i].v.size())minv(li[i].m,li[i].v[j]);
                    break;
                }
                cur+=li[i].v.size();
            }
        }
        else if(type==1){
            int l,r;scanf("%d%d",&l,&r);
            int cur=0;
            int ret=INF;
            rep(i,li.size()){
                if(l<=cur&&cur+li[i].v.size()-1<=r)minv(ret,li[i].m);
                else if(!(r<cur||cur+li[i].v.size()-1<l)){
                    rep(j,li[i].v.size()){
                        if(l<=cur+j&&cur+j<=r)minv(ret,li[i].v[j]);
                    }
                }
                cur+=li[i].v.size();
            }
            printf("%d\n",ret);
        }
        else{
            int pos,val;scanf("%d%d",&pos,&val);
            int cur=0;
            rep(i,li.size()){
                if(cur<=pos&&pos<cur+li[i].v.size()){
                    li[i].v[pos-cur]=val;
                    li[i].m=INF;
                    rep(j,li[i].v.size())minv(li[i].m,li[i].v[j]);
                    break;
                }
                cur+=li[i].v.size();
           }
        }
        if(qry%SQ==SQ-1){
            int cur=0;
            rep(i,li.size()){
                rep(j,li[i].v.size()){
                    a[cur++]=li[i].v[j];
                }
            }
            build();
        }
    }
    return 0;
}