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<vector>
#include<climits>
#include<algorithm>

const int INF = INT_MAX;
const int NIL = -1;

int leftMostBit(int x) {
    if(x == 0) return 0;
    x = (x & 0x55555555) << 1 | (x >> 1) & 0x55555555;
    x = (x & 0x33333333) << 2 | (x >> 2) & 0x33333333;
    x = (x & 0x0f0f0f0f) << 4 | (x >> 4) & 0x0f0f0f0f;
    x = (x << 24) | ((x & 0xff00) << 8) | ((x >> 8) & 0xff00) | (x >> 24);
    int deBruijnSequence[32] = {0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14};
    return 31 - deBruijnSequence[((x & -x) * 0x076be629U) >> 27];
}

class RangeMinimumQuery {
    int size_;
    std::vector<int> node_;

    int parent(int node) const {return node == 0 ? NIL : (node - 1) >> 1;}
    int left_child(int node) const {return (node << 1) + 1;}
    int right_child(int node) const {return (node << 1) + 2;}
    int query(int a, int b, int k, int l, int r) const {
        if(b < l || r < a) return INF;
        if(a <= l && r <= b) return node_[k];
        int vl = query(a, b, left_child(k), l, (l + r) / 2);
        int vr = query(a, b, right_child(k), (l + r) / 2 + 1, r);
        return std::min(vl, vr);
    }

public:
    RangeMinimumQuery(int s) {
        size_ = 1 << leftMostBit(s);
        if(size_ != s) size_ <<= 1;
        node_ = std::vector<int>((size_ << 1) - 1, INF);
    }
    void update_values(int left, int right) {
        int l = left + size_ - 1;
        int r = right + size_ - 1;
        while((l = parent(l)) != (r = parent(r))) {
            for(int i = l; i <= r; ++i) node_[i] = std::min(node_[left_child(i)], node_[right_child(i)]);
        }
        int i = l;
        node_[i] = std::min(node_[left_child(i)], node_[right_child(i)]);
        while((i = parent(i)) != NIL) node_[i] = std::min(node_[left_child(i)], node_[right_child(i)]);
    }
    int find(int left, int right) {
        update_values(left, right);
        return query(left, right, 0, 0, size_ - 1);
    }
    void update(int index, int value) {
        int i = index + size_ - 1;
        node_[i] = value;
//         while((i = parent(i)) != NIL) node_[i] = std::min(node_[left_child(i)], node_[right_child(i)]);
    }
    void circular_shift(int left, int right) {
        int l = left + size_ - 1;
        int r = right + size_ - 1;
        for(int i = r; l < i; --i) std::swap(node_[i], node_[i - 1]);
//         while((l = parent(l)) != (r = parent(r))) {
//             for(int i = l; i <= r; ++i) node_[i] = std::min(node_[left_child(i)], node_[right_child(i)]);
//         }
    }
};

#include<iostream>
using namespace std;

int main() {
    int n, q;

    cin >> n >> q;
    RangeMinimumQuery st(n);
    for(int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        st.update(i, a);
    }

    for(int i = 0; i < q; ++i) {
        int x, y, z;
        cin >> x >> y >> z;
        if(x == 0) {
            st.circular_shift(y, z);
        } else if(x == 1) {
            cout << st.find(y, z) << endl;
        } else {
            st.update(y, z);
        }
    }
}