#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        auto i = vs.begin();
        os << "[" << *i;
        for (++i; i != vs.end(); ++i) os << " " << *i;
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    const int INF = INT_MAX / 2;

    template<class V> struct Treap {
        mt19937 mt;
        Treap() : root(NULL) {
            random_device rnd;
            mt.seed(rnd());
        }

        struct Node {
            V value;
            Node *left, *right;
            int priority;
            int size;
            V res;
            Node(V value, int priority) : value(value), priority(priority), size(1), res(value) {
                left = NULL;
                right = NULL;
            }
        };

        Node *root;
        int size(Node *t) {
            if (t == NULL) return 0;
            return t->size;
        }

        V res(Node *t) {
            if (t == NULL) return INF;
            V l = (t->left == NULL ? INF : t->left->res);
            V r = (t->right == NULL ? INF : t->right->res);
            return min(l, min(t->value, r));
        }

        Node* update(Node *v) {
            v->size = size(v->left) + size(v->right) + 1;
            v->res = min(res(v->left), min(v->value, res(v->right)));
            return v;
        }

        Node* merge(Node *l, Node *r) {
            if (l == NULL) return r;
            if (r == NULL) return l;
            assert(l != NULL && r != NULL);

            if (l->priority > r->priority) {
                l->right = merge(l->right, r);
                return update(l);
            } else {
                r->left = merge(l, r->left);
                return update(r);
            }
        }

        pair<Node*, Node*> split(Node *t, int k) { // [0, k) ??¨ [k, n)?????????
            if (t == NULL) return make_pair((Node*)NULL, (Node*)NULL);
            if (k <= size(t->left)) {
                auto s = split(t->left, k);
                t->left = s.second;
                return make_pair(s.first, update(t));
            } else {
                auto s = split(t->right, k - size(t->left) - 1); // ??????-1?????????????????¨?????¨???root(?????????t)??????
                t->right = s.first;
                return make_pair(update(t), s.second);
            }
        }
        pair<Node*, Node*> split(int k) { return split(root, k); }

        Node* insert(Node *t, int k, V value) {
            auto x = split(t, k);
            auto y = split(x.second, 1);
            return merge(x.first, merge(new Node(value, mt()), y.second));
        }
        Node* insert(int k, V value) { return root = insert(root, k, value); }

        Node* erase(Node *t, int k) {
            auto x = split(t, k);
            auto y = split(x.second, 1);
            return merge(x.first, y.second);
        }
        Node* erase(int k) { return root = erase(root, k); }

        Node* find(Node *t, int k) {
            auto x = split(t, k);
            auto y = split(x.second, 1);
            Node *ret = y.first;
            merge(x.first, merge(y.first, y.second));
            return ret;
        }
        Node* find(int k) { return find(root, k); }
    };

    void solve() {
        int N, Q; cin >> N >> Q;
        Treap<int> t;
        for (int i = 0; i < N; i++) {
            int a; cin >> a;
            t.insert(i, a);
        }
        for (int q = 0; q < Q; q++) {
            int x, y, z; cin >> x >> y >> z;
            if (x == 0) {
                z++;
                auto a = t.split(t.root, y);
                auto b = t.split(a.second, z - y);
                auto v = b.first;
                auto p = t.split(v, z - y - 1);
                auto nv = t.merge(p.second, p.first);
                t.merge(a.first, t.merge(nv, b.second));
            } else if (x == 1) {
                z++;
                auto a = t.split(t.root, y);
                auto b = t.split(a.second, z - y);
                auto v = b.first;
                cout << t.res(v) << endl;
                t.merge(a.first, t.merge(b.first, b.second));
            } else {
                assert(x == 2);
                t.insert(y, z);
            }
            //for (int i = 0; i < N; i++) { cout << t.find(i)->value << " "; } cout << endl;
        }
    }
}

int main() {
    solve();
    return 0;
}

Measured memory_bytes: 15752