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 <iomanip>
#include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>

typedef long long          ll;
typedef unsigned int       uint;
typedef unsigned long long ull;

using namespace std;

template<typename T>
class Treap {
 public:
  Treap() : root_(nullptr) {
  }

  void Insert(int k, T v) {
    root_ = insert(root_, k, v, rand());
  }
  
  void Shift(int l, int r) {
    root_ = shift(root_, l, r + 1);
  }

  T Min(int l, int r) {
    return min(root_, l, r + 1);
  }

  void Update(int k, T v) {
    root_ = erase(root_, k);
    root_ = insert(root_, k, v, rand());
  }

 private:
  static const T INF = 10000001;

  struct node_t {
    T val;
    node_t *lch;
    node_t *rch;
    double pri;
    int cnt;
    T sum;
    T min;

    node_t(int v, double p) : val(v), pri(p), cnt(1), sum(v), min(v) {
      lch = nullptr;
      rch = nullptr;
    }
  };

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

  int sum(node_t *t) {
    return !t ? 0 : t->sum;
  }

  int min(node_t *t) {
    return !t ? INF : t->min;
  }

  node_t *update(node_t *t) {
    t->cnt = count(t->lch) + count(t->rch) + 1;
    t->sum = sum(t->lch) + sum(t->rch) + t->val;
    t->min = std::min(std::min(min(t->lch), min(t->rch)), t->val);
    return t;
  }

  node_t *merge(node_t *l, node_t *r) {
    if (!l) {
      return r;
    } else if (!r) {
      return l;
    }

    if (l->pri > r->pri) {
      l->rch = merge(l->rch, r);
      return update(l);
    } else {
      r->lch = merge(l, r->lch);
      return update(r);
    }
  }

  pair<node_t *, node_t *> split(node_t *t, int k) {  // [0, k), [k, n)
    if (!t)
      return make_pair(nullptr, nullptr);

    if (k <= count(t->lch)) {
      auto s = split(t->lch, k);
      t->lch = s.second;
      return make_pair(s.first, update(t));
    } else {
      auto 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, int val, double pri) {
    auto s = split(t, k);
    node_t *n = new node_t(val, pri);
    return merge(merge(s.first, n), s.second);
  }

  node_t *erase(node_t *t, int k) {
    auto s = split(t, k);
    auto u = split(s.second, 1);
    delete u.first;
    return merge(s.first, u.second);
  }

  node_t *shift(node_t *t, int l, int r) {
    auto c = split(t, r);
    auto b = split(c.first, r - 1);
    auto a = split(b.first, l);
    return merge(merge(a.first, b.second), merge(a.second, c.second));
  }

  int min(node_t *t, int l, int r) {
    if (!t) return INF;
    if (l <= 0 && count(t) <= r) return min(t);
    if (r <= 0 || count(t) <= l) return INF;

    int l_min = min(t->lch, l, r);
    int r_min = min(t->rch, l - count(t->lch) - 1, r - count(t->lch) - 1);
    int ans = std::min(l_min, r_min);
    if (l <= count(t->lch) && count(t->lch) < r) {
      ans = std::min(ans, t->val);
    }
    return ans;
  }

  string print(node_t *t) {
    if (!t) return "";
    string s = print(t->lch);
    s += to_string(t->val) + " ";
    s += print(t->rch);
    return s;
  }

  node_t *root_;
};

int main() {
  int n;
  int q;
  cin >> n >> q;
  Treap<int> t;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    t.Insert(i, a);
  }
  for (int i = 0; i < q; i++) {
    int x;
    int y;
    int z;
    cin >> x >> y >> z;
    if (x == 0) {
      t.Shift(y, z);
    } else if (x == 1) {
      std::cout << t.Min(y, z) << std::endl;
    } else {
      t.Update(y, z);
    }
  }
}