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 rep(i,x,y) for(int i=(x);i<(y);++i)
#define mp(a,b) make_pair((a),(b))
#define debug(x) #x << "=" << (x)
 
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif

typedef long long int ll;
typedef pair<int,int> pii;
//template<typename T> using vec=std::vector<T>;

const int inf=1<<30;
const long long int inf64=1LL<<58;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
	os << "[";
	for (const auto &v : vec) {
		os << v << ",";
	}
	os << "]";
	return os;
}

class xor128{
    public:
    static int rand(){
        t=x^(x<<11);
        x=y;
        y=z;
        z=w;
        w=(w^(w>>19))^(t^(t>>8));
        return w & 0x7fffffff;
    }
    private:
    static unsigned int x;
    static unsigned int y;
    static unsigned int z;
    static unsigned int w;
    static unsigned int t;
};
unsigned int xor128::x=123456789;
unsigned int xor128::y=362436069;
unsigned int xor128::z=521288629;
unsigned int xor128::w=88675123;
unsigned int xor128::t=1;

template<class T> class rbst{
public:
	struct node{
        T val,min;
        node* left,*right;
        unsigned sz;
        node(T val):val(val),min(val),left(NULL),right(NULL),sz(1){}
    };

    node* root;
    rbst():root(NULL){}

    unsigned size(){ return size(root); }
    unsigned size(node*v){ return !v?0:v->sz; }
    T min(node* v){ return v?v->min:numeric_limits<T>::max(); }

	node* update(node* x){
		x->sz=size(x->left)+size(x->right)+1;
        x->min=std::min({x->val,min(x->left),min(x->right)});
		return x;
	}

	node* merge(node* x,node* y){
        if(!x or !y) return x?x:y;
        
		int m=x->sz,n=y->sz;
		if(xor128::rand()%(m+n)<m){
			x->right=merge(x->right,y);
			return update(x);
		}else{
			y->left=merge(x,y->left);
			return update(y);
		}
	}

    //[0,pos),[pos,n)
	pair<node*,node*> split(node* x,unsigned pos){
		if(!x) return make_pair<node*,node*>(NULL,NULL);
		if(size(x->left)<=pos){
			auto tmp=split(x->right,pos-size(x->left));
			x->right=tmp.first;
			return make_pair(x,tmp.second);
		}else{
			auto tmp=split(x->left,pos);
			x->left=tmp.second;
			return make_pair(x,tmp.first);
		}
	}

    node* insert(unsigned pos,T val){ return root=insert(root,pos,val); }
	node* insert(node* x,int pos,T val){
		node* p=new node(val);
		auto tmp=split(x,pos-1);
		node*l=merge(tmp.first,p),*r=tmp.second;
		return merge(l,r);
    }

    node* erase(int pos){ return root=erase(root,pos); }
	node* erase(node* x,int pos){
		auto tmp=split(x,pos-1);
		node* l=tmp.first;
		node* r=split(tmp.second,1).second;
		return merge(l,r);
    }
    
    node* at(unsigned pos){
        node* x=root;
        while(x){
            unsigned sz=size(x->left);
            if(sz>pos) x=x->left;
            else if(sz==pos) return x;
            else{
                x=x->right;
                pos-=sz+1;
            }
        }
        return x;
    }

    //[l,r)
    void shift(int l,int r){
        pair<node*,node*> u,v,w;
        u=split(root,r);
        v=split(u.first,r-1);
        w=split(v.first,l);
        merge(merge(w.first,v.second),merge(w.second,u.second));
    }

    T min(int l,int r){
        pair<node*,node*> u,v;
        u=split(root,r);
        v=split(u.first,l);
        auto res=min(v.second);
        merge(merge(v.first,v.second),u.second);
        return res;
    }

    void update(int pos,int val){
        pair<node*,node*> u,v;
        u=split(root,pos+1);
        v=split(u.first,pos);
        v.second->val=val;
        update(v.second);
        merge(merge(v.first,v.second),u.second);
    }
};

void solve(){
    int n,q;
    cin >> n >> q;
    
    rbst<int> t;
    rep(i,0,n){
        int a;
        cin >> a;
        t.insert(i,a);
    }
    
    rep(i,0,q){
        int x,y,z;
        cin >> x >> y >> z;
        if(x==0) t.shift(y,z+1);
        else if(x==1) t.min(y,z+1);
        else t.update(y,z);
    }
}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	solve();
	return 0;
}