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>

class Node {
public:
  Node() : left(nullptr), right(nullptr) {}
  int val;
  int min;
  int num;
  int rank;
  Node *left, *right;
};

void dump(Node* p) {
  if( p == nullptr ) {
    fprintf(stderr, "(nil)");
    return;
  }
  if( p->left == nullptr and p->right == nullptr ) {
    fprintf(stderr, "{n%d}(%d)", p->num, p->val);
    return;
  }
  fprintf(stderr, "{n%d,r%d,m%d}[", p->num, p->rank, p->min);
  dump(p->left);
  fprintf(stderr, ",");
  dump(p->right);
  fprintf(stderr, "]");
}

void dumpLine(Node* p) {
  return;
  dump(p);
  puts("");
}

template<typename T, int chunksize = 262144>
class Heap {
public:
  Heap() : n(chunksize) {}
  std::vector<T*> ptrs;
  std::stack<T*>  stack;
  int n;
  T* next() {
    if( not stack.empty() ) {
      T* res = stack.top(); stack.pop();
      return res;
    }
    if( n == chunksize ) {
      T* p = new T[chunksize];
      ptrs.push_back(p);
      n = 0;
    }
    T* res = &ptrs[ptrs.size()-1][n];
    n += 1;
    return res;
  }
  void push(T* p) {
    stack.push(p);
  }
};
Heap<Node> heap;

Node* initNode(int val) {
  Node *p = heap.next();
  p->left = p->right = nullptr;
  p->min = p->val = val;
  p->num = 1;
  p->rank = 1;
  return p;
}

Node* initNode(Node* left, Node* right) {
  Node *p = heap.next();
  p->left = left;
  p->right = right;
  return p;
}

bool isLeaf(Node *p) {
  assert( p != nullptr );
  return p->left == nullptr and p->right == nullptr;
}

Node* update(Node* p) {
  if( p == nullptr ) return nullptr;
  if( isLeaf(p) ) return p;
  p->min = (1<<30);
  p->num = 0;
  p->rank = 1;
  if( p->left != nullptr ) {
    p->min = std::min(p->min, p->left->min);
    p->num += p->left->num;
    p->rank = std::max(p->rank, p->left->rank + 1);
  }
  if( p->right != nullptr ) {
    p->min = std::min(p->min, p->right->min);
    p->num += p->right->num;
    p->rank = std::max(p->rank, p->right->rank + 1);
  }
  return p;
}


Node* rotate(Node *v, int d) {
  //fprintf(stderr, "rotate : %d\n", d);
  assert( not isLeaf(v) );
  if( d < 0 ) {
    Node *w = v->right;
    if( isLeaf(w) ) return v;
    if( w == nullptr ) return v;
    Node *a = w->left;
    v->right = a;
    w->left = v;
    update(v);
    update(w);
    return w;
  }
  if( d > 0 ) {
    Node *w = v->left;
    if( isLeaf(w) ) return v;
    if( w == nullptr ) return v;
    Node *a = w->right;
    v->left = a;
    w->right = v;
    update(v);
    update(w);
    return w;
  }
  assert(0);
}

inline int getRank(Node* p) {
  if( p == nullptr ) return 0;
  return p->rank;
}

Node* merge(Node* a, Node* b, int d) {
  if( a == nullptr and b == nullptr ) return nullptr;
  if( a == nullptr or b == nullptr ) return a == nullptr ? b : a;
  int rL = getRank(a);
  int rR = getRank(b);
  if( rL == rR ) {
    Node *p = initNode(a, b);    
    return update(p);
  }
  assert( a != nullptr and b != nullptr );
  Node *v, *w;
  if( rL < rR ) {
    v = b;
    w = merge(a, b->left, -1);
    v->left = w;
  }
  else {
    v = a;
    w = merge(a->right, b, 1);
    v->right = w;
  }
  assert( v->left != nullptr and v->right != nullptr );
  int rD = getRank(v->right) - getRank(v->left);
  if( rD < -1 ) v = rotate(v, 1);
  else if( 1 < rD ) v = rotate(v, -1);
  else if( rD < 0 and 0 < d ) v = rotate(v, 1);
  else if( 0 < rD and d < 0 ) v = rotate(v, -1); 
  return update(v);
}

std::tuple<Node*, Node*> split(Node* p, int n) {
  if( p == nullptr ) return std::make_tuple(nullptr, nullptr);
  if( isLeaf(p) ) {
    if( n == 0 ) return std::make_tuple(nullptr, p);
    else return std::make_tuple(p, nullptr);
  }
  assert( p->left != nullptr and p->right != nullptr );
  int m = p->left->num;
  if( n <= m ) {
    auto t = split(p->left, n);
    return std::make_pair(std::get<0>(t), merge(std::get<1>(t), p->right, 0));
  }
  else {
    auto t = split(p->right, n - p->left->num);
    return std::make_pair(merge(p->left, std::get<0>(t), 0), std::get<1>(t));
  }
}

// [l, r)
int minimum(Node* p, int l, int r) {
  //fprintf(stderr, "(l, r) = (%d, %d)\n", l, r);
  if( p == nullptr ) return (1 << 30);
  assert( p != nullptr );
  assert( r <= p->num );
  if( isLeaf(p) ) return p->min;
  if( l == 0 and r == p->num ) return p->min;
  assert( p->left != nullptr and p->right != nullptr );
  int m = p->left->num;
  if( r <= m ) return minimum(p->left, l, r);
  if( m <= l ) return minimum(p->right, l - m, r - m);
  assert( l < m and m < r );
  return std::min(minimum(p->left, l, m), minimum(p->right, m - m, r - m));
}

Node* updateVal(Node* p, int k, int v) {
  if( isLeaf(p) and k == 0 ) {
    p->min = p->val = v;
    p->num = 1;
    return p;
  }
  assert( not ( isLeaf(p) and k != 0 ) );
  int m = p->left == nullptr ? 0 : p->left->num;
  if( k < m ) {
    p->left = updateVal(p->left, k, v);
    return update(p);
  }
  else {
    p->right = updateVal(p->right, k - m, v);
    return update(p);
  }
}

int main() {

  Node* root = nullptr;

  int n; scanf("%d", &n);
  int q; scanf("%d", &q);
  for(int i = 0; i < n; ++i) {
    int a; scanf("%d", &a);
    root = merge(root, initNode(a), 1);
    dumpLine(root);
  }
  dumpLine(root);
  for(int i = 0; i < q; ++i) {
    int x, y, z;
    scanf("%d %d %d", &x, &y, &z);
    if( x == 0 ) {
      Node *n1, *n2, *n3, *n4;
      std::tie(n1, n2) = split(root, y);
      dumpLine(n1);
      std::tie(n2, n3) = split(n2, z - y);
      dumpLine(n2);
      std::tie(n3, n4) = split(n3, 1);
      dumpLine(n3);
      dumpLine(n4);
      root = merge(merge(merge(n1, n3, 1), n2, 1), n4, 1);
    }
    if( x == 1 ) {
      int res = minimum(root, y, z + 1);
      printf("%d\n", res);
    }
    if( x == 2 ) {
      root = updateVal(root, y, z);
    }
    dumpLine(root);
  }
  
  return 0;
}