#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
int getrand(int x){static uint32_t y=time(0);y^=(y<<13);y^=(y>>17);y^=(y<<5);return y%x;}
using V = int;
struct Node {
    V val;
    Node *lch, *rch;
    int sz;
    Node(int a) :val(a), lch(0), rch(0), sz(1) { init(); }

    int ans;
    void init() { ans = val; }
    void push() { }
    void update() {
        ans = val;
        if (lch) ans = min(ans, lch->ans);
        if (rch) ans = min(ans, rch->ans);
    }
    void dump() {
        cout << val << " ";
    }
};
struct SuperSegTree {
    SuperSegTree() :root(NULL) {}
    Node *root;
    inline int getsz(Node *t) { return t ? t->sz : 0; }
    int getsz() { return getsz(root); }
    inline void push(Node *t) { if (t == NULL)return; t->push(); }
    inline Node *update(Node *t){
        if(!t)return 0;t->sz=getsz(t->lch)+getsz(t->rch)+1;t->update();return t;
    }

    Node *merge(Node *a, Node *b) {
        push(a); push(b);
        if (!a)return b;
        if (!b)return a;

        if (getrand(getsz(a) + getsz(b))<getsz(a)) {
            a->rch = merge(a->rch, b);
            return update(a);
        }
        else {
            b->lch = merge(a, b->lch);
            return update(b);
        }
    }

    template<class... T> Node *merge(Node *a, T... y) { return merge(a, merge(y...)); }

    pair<Node *, Node *>split(Node *t, int k) {//[0,k) [k,N)
        push(t);
        if (!t)return make_pair(t, t);
        if (k <= getsz(t->lch)) {
            pair<Node *, Node *>s = split(t->lch, k);
            t->lch = s.second;
            return make_pair(s.first, update(t));
        }
        else {
            pair<Node *, Node *>s = split(t->rch, k - getsz(t->lch) - 1);
            t->rch = s.first;
            return make_pair(update(t), s.second);
        }
    }

    int lower_bound(Node *t, V x) {
        push(t);
        if (!t)return 0;
        if (t->val >= x)return lower_bound(t->lch, x);
        return lower_bound(t->rch, x) + getsz(t->lch) + 1;
    }

    template<typename Func> int lower_bound(V x, Func f = NULL) {
        if (f == NULL) return lower_bound(root, x);
        return lower_bound(root, x, f);
    }

    template<typename Func> int lower_bound(Node *t, V x, Func f) {
        push(t);
        if (!t)return 0;
        if (f(x, t->val)) return lower_bound(t->lch, x);
        return lower_bound(t->rch, x) + getsz(t->lch) + 1;
    }

    // [l,r]????????§a,b,c????????????(????????£?????????????????¨????????????????????¨)
    // root???0????????£??????
    tuple<Node*, Node*, Node*> split3(int l, int r) {
        auto p = split(root, l);

        auto a = p.first;

        auto q = split(p.second, r - l + 1);

        auto b = q.first;
        auto c = q.second;
        root = 0;

        return make_tuple(a, b, c);
    }

    void change(int i, Node* v) { // i?????????v?????´??°
        auto p = split(root, i);
        auto a = p.first;
        auto q = split(p.second, 1);
        Node* b = q.first;
        auto c = q.second;

        b = v;

        root = merge(merge(a, b), c);
    }

    void dump() {
        dump(root);
        cout << endl;
    }
    void dump(Node *t) {
        if (t == NULL)return;
        push(t);
        dump(t->lch);
        t->dump();
        dump(t->rch);
    }
    void push_back(Node *t) {
        root = merge(root, t);
    }

    void shift(int l, int r) { // [l,r]?????????????????????????????????(????????????????§????)
        Node *a, *b, *c;
        tie(a, b, c) = split3(l, r);

        Node *ba, *bb;
        tie(ba, bb) = split(b, r - l);

        root = merge(root, a, bb, ba, c);
    }

    Node* getAt(int i) {
        auto p = split(root, i);
        auto a = p.first;
        auto q = split(p.second, 1);
        Node* b = q.first;
        auto c = q.second;

        root = merge(merge(a, b), c);

        return b;
    }

    auto query(int l, int r) { // [l,r]
        Node *a, *b, *c;
        tie(a, b, c) = split3(l, r);

        auto res = b->ans;

        root = merge(root, a, b, c);

        return res;
    }

    // -- like vector --------------------------------------

    /*void push_back(V v) {
        push_back(Node(v));
    }

    V get(int i) {
        assert(0 <= i and i < getsz());
        auto nd = getAt(i);
        return nd->val;
    }
    void update(int i, V v) {
        assert(0 <= i and i < getsz());

        auto p = split(root, i);
        auto a = p.first;
        auto q = split(p.second, 1);
        Node* b = q.first;
        b->val = v;
        auto c = q.second;

        root = merge(merge(a, b), c);
    }*/


};
/*---------------------------------------------------------------------------------------------------
????????????????????????????????? ??§?????§  
??????????????? ??§?????§ ???????´<_??? ?????? Welcome to My Coding Space!
???????????? ??? ?´_???`??????/??? ???i     
?????????????????????????????? ???  |???|     
????????? /?????? /??£??£??£??£/??????|  
??? ???_(__??????/???    ???/ .| .|????????????  
??? ????????????/????????????/??????u??????  
---------------------------------------------------------------------------------------------------*/




int N, Q;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> Q;

    SuperSegTree sst;
    rep(i, 0, N) {
        int a; cin >> a;
        sst.push_back(new Node(a));
    }

    rep(q, 0, Q) {
        int x, y, z; cin >> x >> y >> z;

        //sst.dump();

        if (x == 0) {
            sst.shift(y, z);
        }
        else if (x == 1) {
            printf("%d\n", sst.query(y, z));
        }
        else {
            sst.change(y, new Node(z));
        }
    }
}

Measured memory_bytes: 15756