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<iostream>
#include<vector>
#include<algorithm>
#include<climits>
#include<string>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#define INF 10000000001

using namespace std;

typedef long long ll;


template<class T>
struct Treap {

public:

  struct node_t{
    T val,mini,sum,lazy;
    node_t *lch,*rch;
    int pri,cnt;
    bool rev;
    
    node_t(T v,int p):val(v),mini(v),sum(v),pri(p),cnt(1){
      lch=rch=NULL;
      lazy=0;
      rev=false;
    }
  };

  node_t *root;
  Treap():root(NULL){}
  
private:

  T val(node_t *t){return t->val+t->lazy;}
  int count(node_t *t){return !t?0:t->cnt;}
  T sum(node_t *t){return !t?0:t->sum+t->lazy*count(t);}
  T mini(node_t *t){return !t?INF:t->mini+t->lazy;}
  
  inline node_t *update(node_t *t){

    if(!t)return t;

    t->cnt=count(t->lch)+count(t->rch)+1;
    t->sum=sum(t->lch)+sum(t->rch)+val(t);
    t->mini=min(min(mini(t->lch),mini(t->rch)),val(t));
    
    //if(t->val!=0){
    if(t->lazy){
      t->val+=t->lazy;
      if(t->lch)t->lch->lazy+=t->lazy;
      if(t->rch)t->rch->lazy+=t->lazy;
      t->lazy=0;
    }
    
    if(t->rev){
      swap(t->lch,t->rch);
      if(t->lch)t->lch->rev^=true;
      if(t->rch)t->rch->rev^=true;
      t->rev=false;
    }
    return t;
  }
  
  node_t *merge(node_t *l, node_t *r){

    l=update(l), r=update(r);
    if(!l || !r)return l?l:r;
    
    if(l->pri > r->pri){
      l->rch=merge(l->rch,r);
      return update(l);
    } else {
      r->lch=merge(l,r->lch);
      return update(r);
    }
  }
  
  //[0,k),[k,n)
  pair<node_t *,node_t *> split(node_t *t,int k){
    if(!update(t))return make_pair((node_t *)NULL,(node_t *)NULL);
    
    if(k<=count(t->lch)){
      pair<node_t *,node_t *>s=split(t->lch,k);
      t->lch=s.second;
      return make_pair(s.first,update(t));
    } else {
      pair<node_t *,node_t *>s=split(t->rch,k-count(t->lch)-1);
      t->rch=s.first;
      return make_pair(update(t),s.second);
    }
  }
  
  node_t *insert(node_t *t,int k,T val,int pri){
    pair<node_t *,node_t *>s=split(t,k);
    t=merge(s.first, new node_t(val,pri));
    t=merge(t,s.second);
    return update(t);
  }
  
  node_t *erase(node_t *t,int k){
    pair<node_t *,node_t *>s1,s2;
    s2=split(t,k+1);
    s1=split(s2.first,k);
    return update((t=merge(s1.first,s2.second)));
  }
  
  node_t *find(node_t *t, int k){
    int c = count(t->lch);
    if(k < c)return find(t->lch, k);
    if(k == c)return t;
    return find(t->rch, k-c-1);
  }

  T rangeMinimumQuery(int l,int r,node_t *t){
    
    t=update(t);

    int sz=count(t);
    if(r<=0 || sz<=l)return INF;
    if(l<=0 && sz<=r)return mini(t);
    
    int cnt=count(t->lch);

    T resl=rangeMinimumQuery(l,r,t->lch);
    T resr=rangeMinimumQuery(l-cnt-1,r-cnt-1,t->rch);
    T res=min(resl,resr);
    if(l<=cnt && cnt<r)res=min(res,val(t));
    return res;
    
  }
  
  T rangeSumQuery(int l,int r,node_t *t){

    t=update(t);

    int sz=count(t);
    if(r<=0 || sz<=l)return 0;
    if(l<=0 && sz<=r)return sum(t);

    int cnt=count(t->lch);
    T res=0;
    res+=rangeSumQuery(l,r,t->lch);
    res+=rangeSumQuery(l-cnt-1,r-cnt-1,t->rch);
    if(l<=cnt && cnt<r)res+=val(t);
    return res;
  }
  
public:

  void insert(int k,T val){ root=insert(root,k,val,rand()); }
  void erase(int k){ root=erase(root,k); }
  node_t *find(int k){ return find(root,k); }
  
  void add(int id,T val){
    node_t *a=find(id);
    T tmp=val(a);
    erase(id);
    insert(id,tmp+val);
  }

  void rangeAdd(int l,int r,T v){
    
    pair<node_t *,node_t *>s1,s2;
    s2=split(root,r);
    s1=split(s2.first,l);
    node_t *a=s1.first,*b=s1.second,*c=s2.second;   
    b->lazy+=v;
    root=merge(a,b);
    root=merge(root,c);
  }

  void update(int id,T val){
    erase(id);
    insert(id,val);
  }
  

  //range query [l,r),0-origin
   
  //Initialize INF 
  T rangeMinimumQuery(int l,int r){
    return rangeMinimumQuery(l,r,root);
  }
  
  //Initialize 0
  T rangeSumQuery(int l,int r){
    return rangeSumQuery(l,r,root);
  }

  /*
   reverse(1,4)
   {1,2,3,4,5} -> {1,4,3,2,5}
   */
  void reverse(int l,int r){
    pair<node_t *,node_t *>s1,s2;
    s2=split(root,r);
    s1=split(s2.first,l);
    node_t *a=s1.first,*b=s1.second,*c=s2.second;   
    b->rev^=true;
    root=merge(a,b);
    root=merge(root,c);
  }

  /*
    revolve(1,4,2)
    {1,2,3,4,5} -> {1,3,4,2,5}  
   */
  void revolve(int l,int r,int t){
    t%=(r-l);
    pair<node_t*, node_t*>a,b,c;
    c=split(root, r);
    b=split(c.first, r-t);
    a=split(b.first, l);
    root=merge(a.first, b.second);
    root=merge(root, a.second);
    root=merge(root, c.second);
  }
};

int main(void){
  
  srand(time(NULL));
  
  int n,m;
  Treap<ll> t;
  
  scanf("%d %d",&n,&m);
  //cin >> n >> m;
  for(int i=0;i<n;i++){
    int in;
    //cin >> in;
    scanf("%d",&in);
    t.insert(i,in);
  }

  //  cin >> m;
  /*
  string com;
  int x,y,T,D,P;

  for(int i=0;i<m;i++){
    cin >> com;

    if(com=="ADD"){
      cin >> x >> y >> D;
      t.rangeAdd(x-1,y,D);
    }
    else if(com=="REVERSE"){
      cin >> x >> y;
      t.reverse(x-1,y);
    }
    else if(com=="REVOLVE"){
      cin >> x >> y >> T;
      t.revolve(x-1,y,T);
    }
    else if(com=="INSERT"){
      cin >> P;
      t.insert(x-1,P);
    }
    else if(com=="DELETE")t.erase(x-1);
    else if(com=="MIN"){
      cin >> x >> y;
      cout << t.rangeMinimumQuery(x-1,y) << endl;
    }
  }
  */

  int x,y,z;
  for(int i=0;i<m;i++){
    //cin >> x >> y >> z;
    scanf("%d %d %d",&x,&y,&z);
    if(x==0)t.revolve(y,z+1,1);
    if(x==1)cout << t.rangeMinimumQuery(y,z+1) << endl;
    if(x==2)t.update(y,z);
  }
  
  
  return 0;
}