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 INFLL=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;
}

/*
template<class T> class treap{
    public:
    struct node{
        T val,sum;
        node *left,*right;
        int pri;
        unsigned sz;
        node(T val,int pri):val(val),sum(sum),pri(pri),sz(1){
            left=right=NULL;
        }
    };
    
    node *root;
    treap():root(NULL){
        srand(time(NULL));
    }
    
    unsigned size(){ return size(root); }
    unsigned size(node *v){ return !v?0:v->sz; }
    T sum(node *v){ return !v?0:v->sum; }
    
    node *update(node *v){
        v->sz=size(v->left)+size(v->right)+1;
        v->sum=sum(v->left)+sum(v->right)+v->val;
        return v;
    }
    
    node *merge(node *s,node *t){
        if(!s or !t) return s?s:t;
        if(s->pri > t->pri){
            s->right=merge(s->right,t);
            return update(s);
        }
        t->left=merge(s,t->left);
        return update(t);
    }
    
    pair<node*,node*> split(node *v,unsigned k){ //[0,k),[k,n)
        if(!v) return pair<node*,node*>(NULL,NULL);
        if(k<=size(v->left)){
            pair<node*,node*> s=split(v->left,k);
            v->left=s.second;
            return make_pair(s.first,update(v));
        }
        pair<node*,node*> s=split(v->right,k-size(v->left)-1);
        v->right=s.first;
        return make_pair(update(v),s.second);
    }
    
    node *find(unsigned k){
        node *v=root;
        while(v){
            unsigned s=size(v->left);
            if(s>k) v=v->left;
            else if(s==k) return v;
            else{
                v=v->right;
                k-=s+1;
            }
        }
        return v;
    }
    
    void insert(unsigned k,T val){ root=insert(root,k,val,rand()); }
    node *insert(node *t,unsigned k,T val,int pri){
        pair<node*,node*> s=split(t,k);
        t=merge(s.first,new node(val,pri));
        t=merge(t.s.second);
        return update(t);
    }
    
    void erase(int k){ root=erase(root,k); }
    node *erase(node *t,unsigned k){
        pair<node*,node*> u,v;
        u=split(t,k+1);
        v=split(u.first,k);
        t=merge(v.first,u.second);
        return update(t);
    }
};
*/

template<class T> class treap{
    public:
    struct node{
        T val,min;
        node *left,*right;
        int pri;
        unsigned sz;
        node(T val,int pri):val(val),min(val),pri(pri),sz(1){
            left=right=NULL;
        }
    };
    
    node *root;
    treap():root(NULL){
        srand(time(NULL));
    }
    
    unsigned size(){ return size(root); }
    unsigned size(node *v){ return !v?0:v->sz; }
    T min(node *v){ return !v?INF:v->min; }
    
    node *update(node *v){
        v->sz=size(v->left)+size(v->right)+1;
        v->min=std::min({min(v->left),min(v->right),v->val});
        return v;
    }
    
    node *merge(node *s,node *t){
        if(!s or !t) return s?s:t;
        if(s->pri > t->pri){
            s->right=merge(s->right,t);
            return update(s);
        }
        t->left=merge(s,t->left);
        return update(t);
    }
    
    pair<node*,node*> split(node *v,unsigned k){ //[0,k),[k,n)
        if(!v) return pair<node*,node*>(NULL,NULL);
        if(k<=size(v->left)){
            pair<node*,node*> s=split(v->left,k);
            v->left=s.second;
            return make_pair(s.first,update(v));
        }
        pair<node*,node*> s=split(v->right,k-size(v->left)-1);
        v->right=s.first;
        return make_pair(update(v),s.second);
    }
    
    node *find(unsigned k){
        node *v=root;
        while(v){
            unsigned s=size(v->left);
            if(s>k) v=v->left;
            else if(s==k) return v;
            else{
                v=v->right;
                k-=s+1;
            }
        }
        return v;
    }
    
    void insert(unsigned k,T val){ root=insert(root,k,val,rand()); }
    node *insert(node *t,unsigned k,T val,int pri){
        pair<node*,node*> s=split(t,k);
        t=merge(s.first,new node(val,pri));
        t=merge(t,s.second);
        return update(t);
    }
    
    void erase(int k){ root=erase(root,k); }
    node *erase(node *t,unsigned k){
        pair<node*,node*> u,v;
        u=split(t,k+1);
        v=split(u.first,k);
        t=merge(v.first,u.second);
        return update(t);
    }
    
    //[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));
    }
    
    void min(int l,int r){
        pair<node*,node*> u,v;
        u=split(root,r);
        v=split(u.first,l);
        cout << min(v.second) << endl;
        merge(merge(v.first,v.second),u.second);
    }
    
    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;
    
    treap<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;
}