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 int long long
#define FR first
#define SC second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)

typedef pair<int, int> P;

const int inf = 1LL << 55;

// Randomized Binary Search Tree : ??????????????¢?´¢??¨
int xor128()
{
  static int x = 123456789;
  static int y = 362436069;
  static int z = 521288629;
  static int w = 88675123;
  int t;

  t = x ^ (x << 11);
  x = y; y = z; z = w;
  return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}

struct node
{
  int val;
  int cnt; // size of subtree
  node *lch, *rch;

  int mini, maxi; // range-query value

  node(int v = 0):val(v), cnt(1), lch(nullptr), rch(nullptr), mini(v), maxi(v){}
};

inline int count(node* t)
{
  return (t ? t->cnt : 0);
}

inline int range_min(node* t)
{
  return (t ? t->mini : inf);
}

inline int range_max(node* t)
{
  return (t ? t->maxi : -inf);
}

inline node* update(node* t)
{
  t->cnt = count(t->lch) + count(t->rch) + 1;
  t->mini = min(t->val, min(range_min(t->lch), range_min(t->rch)));
  t->maxi = max(t->val, max(range_max(t->lch), range_max(t->rch)));
  return t;
}

inline node* make_root(int val)
{
  return (new node(val));
}

node* merge(node *l, node *r)
{
  if(!l || !r) return (l ? l : r);
  int lsz = l->cnt, rsz = r->cnt;
  if(xor128() % (lsz + rsz) < lsz) {
    l->rch = merge(l->rch, r);
    return update(l);
  } else {
    r->lch = merge(l, r->lch);
    return update(r);
  }
}

// split tree in [0, k) and [k, n)
pair<node*, node*> split(node *t, int k)
{
  if(!t) return make_pair(nullptr, nullptr);
  if(k <= count(t->lch)) {
    pair<node*, node*> s = split(t->lch, k);
    t->lch = s.second;
    return make_pair(s.first, update(t));
  } else {
    pair<node*, node*> s = split(t->rch, k - count(t->lch) - 1);
    t->rch = s.first;
    return make_pair(update(t), s.second);
  }
}

node* insert(node *t, int k, int val)
{
  node *p = make_root(val);
  pair<node*, node*> s = split(t, k);
  return merge(merge(s.first, p), s.second);
}

node* erase(node *t, int k)
{
  pair<node*, node*> s = split(t, k);
  pair<node*, node*> u = split(s.second, 1);
  delete u.first;
  return merge(s.first, u.second);
}

int lower_bound(node* t, int val)
{
  if(!t) return 0;
  if(val < t->val) return lower_bound(t->lch, val);
  return lower_bound(t->rch, val) + count(t->lch) + 1;
}

node* insert(node* t, int val)
{
  return insert(t, lower_bound(t, val), val);
}

void dump(node* t)
{
  if(!t) return;
  cout << "(";
  dump(t->lch);
  cout << "" << t->val << "";
  dump(t->rch);
  cout << ")";
}

signed main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  int n, q; cin >> n >> q;
  node* root = nullptr;
  vector<int> a(n);
  rep(i, n) {
    cin >> a[i];
    root = insert(root, i, a[i]);
  }
  while(q--) {
    int x, y, z;
    cin >> x >> y >> z;
    if(x == 0) {
      auto p = split(root, z); // [0,z)[z,n)
      auto q = split(p.first, y); // [0,y)[y,z)[z,n)
      auto r = split(p.second, 1); // [0,y)[y,z)[z][z+1,n)
      auto s = merge(q.first, r.first); // [0,y)[z]
      auto t = merge(q.second, r.second); // [y,z)[z+1,n)
      root = merge(s, t); // [0,y)[z][y,z)[z+1,n)
    } else if(x == 1) {
      auto s = split(root, y);
      auto t = split(s.second, z - y + 1);
      cout << range_min(t.first) << endl;
      root = merge(s.first, merge(t.first, t.second));
    } else if(x == 2) {
      root = erase(root, y);
      root = insert(root, y, z);
    }
  }
  return 0;
}