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++: #define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(int i=a; i<int(b); i++)
#define rep(i,b) loop(i,0,b)
#define each(e,c) for(auto& e:c)
#define iter(it,c) for(auto it=c.begin(); it!=c.end(); ++it)

ll const inf = 1 << 28;
double const pi = acos(-1);

int n, q;
int a[300000];

void view(vvi const& a){
    rep(i, a.size()){
        rep(j, a[i].size()){
            if (a[i][j] == inf) cout << "inf";
            else {
                if (a[i][j] >= 100) cout << a[i][j] / 1000;
                else cout << a[i][j];
            }
            if (j != a[i].size() - 1) cout << " ";
        }
        if (i != a.size() - 1) cout << "|";
    }
    cout << endl;
}

pair<int, int> index(const vvi& tree, int k){
    int s = 0;
    int i = 0;
    while (s + (int)tree[i].size() <= k){
        s += tree[i].size();
        i++;
    }
    int j = 0;
    while (s + j < k) j++;
    return make_pair(i, j);
}

int solve(){

    int w = sqrt(n);
    if (w*w != n) w++;
    vvi tree(w, vi(w, inf));
    vi rmq(w, inf);
    rep(i, w){
        rep(j, w){
            int x = a[i*w + j];
            rmq[i] = min(x, rmq[i]);
            tree[i][j] = x;
        }
    }

    //view(tree);

    rep(_, q){
        int x, y, z; scanf("%d%d%d", &x, &y, &z);
        //printf("----------\n%d %d %d\n", x, y, z);
        if (x == 0){

            // shift
            int L = y, R = z;
            auto p = index(tree, L), q = index(tree, R);
            int i1 = p.first, j1 = p.second;
            int i2 = q.first, j2 = q.second;
            int t = tree[i2][j2];
            tree[i2].erase(tree[i2].begin() + j2);
            tree[i1].insert(tree[i1].begin() + i2, t);

        }
        else if (x == 1){

            // rmq
            int L = y, R = z;
            auto p = index(tree, L), q = index(tree, R);
            int i1 = p.first, j1 = p.second;
            int i2 = q.first, j2 = q.second;
            int res = inf;
            if (i1 == i2){
                loop(t, j1, j2 + 1){
                    res = min(res, tree[i1][t]);
                }
            }
            else{
                loop(t, j1, tree[i1].size()){
                    res = min(res, tree[i1][t]);
                }
                loop(t, i1 + 1, i2){
                    res = min(res, rmq[t]);
                }
                loop(t, 0, j2 + 1){
                    res = min(res, tree[i2][t]);
                }
            }
            printf("%d\n", res);

        }
        else if (x == 2){

            // update
            int k = y, x = z;
            auto p = index(tree, k);
            tree[p.first][p.second] = x;
            rmq[p.first] = min(rmq[p.first], x);

        }

        //view(tree);
    }
    return 0;
}

int main(){
    while (scanf("%d%d", &n, &q) != EOF){
        rep(i, 300000) a[i] = inf;
        rep(i, n) scanf("%d", a + i);
        solve();
    }
}