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>

struct splay_node {
  splay_node * left, * right, *parent;
  int size, value, minimum;

  splay_node() {
    left = nullptr;
    right = nullptr;
    parent = nullptr;
    size = 1;
  }

  void rotate() {
    splay_node *pp, *p, *c;
    p = this->parent;
    pp = p->parent;

    if (p->left==this) {
      c = this->right;
      this->right = p;
      p->left = c;
    }
    else {
      c = this->left;
      this->left = p;
      p->right = c;
    }

    if (pp && pp->left==p) pp->left = this;
    if (pp && pp->right==p) pp->right = this;
    this->parent = pp;
    p->parent = this;
    if (c) c->parent = p;

    p->update();
    this->update();
  }
  int state() {
    if (!parent) return 0;
    if (parent->left==this) return 1;
    if (parent->right==this) return -1;
    return {};
  }
  void splay() {
    while (this->state() != 0) {
      if (this->parent->state()==0) {
        this->rotate();
      }
      else if (this->state() == this->parent->state()) {
        this->parent->rotate();
        this->rotate();
      } else {
        this->rotate();
        this->rotate();
      }
    }
  }
  void update() {
    this->size = 1;
    this->minimum = this->value;
    if (this->left) {
      this->size += this->left->size;
      this->minimum = std::min(this->minimum, this->left->minimum);
    }
    if (this->right) {
      this->size += this->right->size;
      this->minimum = std::min(this->minimum, this->right->minimum);
    }
  }
};

splay_node * get(int ind, splay_node * root) {
  splay_node * now = root;
  while (true) {
    int lsize = now->left ? now->left->size : 0;
    if (ind < lsize) {
      now = now->left;
    }
    if (ind == lsize) {
      now->splay();
      return now;
    }
    if (lsize < ind) {
      now = now->right;
      ind = ind - lsize - 1;
    }
  }
}

typedef splay_node sn;

sn * merge(sn *lroot, sn* rroot) {
  if (!lroot) return rroot;
  if (!rroot) return lroot;
  lroot = get(lroot->size - 1, lroot);
  lroot->right = rroot;
  rroot->parent = lroot;
  lroot->update();
  return lroot;
}

std::pair<sn*, sn*> split(int left_cnt, sn* root) {
  if (left_cnt == 0) return {nullptr, root};
  if (left_cnt == root->size) return {root, nullptr};
  root = get(left_cnt, root);
  sn * lroot, * rroot;
  lroot = root->left;
  rroot = root;
  rroot->left = nullptr;
  lroot->parent = nullptr;
  rroot->update();
  return {lroot, rroot};
}

sn * insert(int ind, sn * node, sn * root) {
  auto trees = split(ind, root);
  sn * lroot = trees.first;
  sn * rroot = trees.second;
  return merge( merge(lroot, node), rroot);
}

std::pair<sn*, sn*> remove(int ind, sn * root) {
  root = get(ind, root);
  sn * lroot = root->left;
  sn * rroot = root->right;
  if (lroot) lroot->parent = nullptr;
  if (rroot) rroot->parent = nullptr;
  root->left = nullptr;
  root->right = nullptr;
  root->update();
  return {merge(lroot, rroot), root};
}

sn * shift(int l, int r, sn * root) {
  auto tmp = remove(r, root);
  root = tmp.first;
  sn * node = tmp.second;
  return insert(l, node, root);
}

std::pair<sn*, int> rmq(int l, int r, sn * root) {
  sn * lroot, *croot, *rroot;
  auto tmp = split(r+1, root);
  rroot = tmp.second;
  tmp = split(l, tmp.first);
  lroot = tmp.first;
  croot = tmp.second;
  int ans = croot->minimum;
  return {merge(merge(lroot, croot), rroot), ans};
}

sn node[220000];

int main() {
  int n, q, ord, l, r, pos, val;
  std::cin >> n >> q;

  for (int i = 0; i < n - 1; i++) {
    node[i].parent = &node[i+1];
    node[i+1].left = &node[i];
    node[i+1].update();
  }
  for (int i = 0; i < n; i++) {
    std::cin>> node[i].value;
    node[i].update();
  }
  splay_node * root = &node[n-1];

  for (int i = 0; i < q; i++) {
    std::cin >> ord;
    if (ord==0) {
      std::cin >> l >> r;
      root = shift(l, r, root);
    }
    if (ord==1) {
      std::cin >> l >> r;
      auto tmp = rmq(l, r, root);
      root = tmp.first;
      std::cout << tmp.second << std::endl;
    }
    if (ord==2) {
      std::cin>> pos >> val;
      root = get(pos, root);
      root->value = val;
      root->update();
    }
  }
}