#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max()/4;
const int n_max = 1e5+10;



struct SplayNode {
    SplayNode *parent, *right, *left;
    ll size, value, minimum;

    SplayNode(){
        parent = nullptr;
        right = nullptr;
        left = nullptr;
        size = 1;
    }

    void rotate(){
        SplayNode *pp, *p, *c;
        p = this->parent;
        pp = p->parent;

        if(pp && pp->left == p)pp->left = this;
        if(pp && pp->right == p) pp->right = this;
        this->parent = pp;

        if(p->left == this) {
            c = this->right;
            this->right = p;
            p->left = c;
        }
        else {
            c = this->left;
            this->left = p;
            p->right = c;
        }
        
        p->parent = this;
        if(c) c->parent = p;

        p->update();
        this->update();
    };

    int state(){
        if(!this->parent)return 0;
        if(this->parent->left == this)return 1;
        if(this->parent->right == this)return 2;
        return 0;
    }
    void splay(){
        while(this->state()){
            if(this->parent->state() == 0){
                this->rotate();
            }
            else if(this->state() == this->parent->state()){
                this->parent->rotate();
                this->rotate();
            }
            else{
                this->rotate();
                this->rotate();
            }
        }
    };
    void update(){
        this->size = 1;
        this->minimum = this->value;
        if(this->left){
            this->size += this->left->size;
            this->minimum = min(this->minimum, this->left->minimum);
        }
        if(this->right){
            this->size += this->right->size;
            this->minimum = min(this->minimum, this->right->minimum);
        }
    };
    
    
};

using SN = SplayNode;

SplayNode* get(int ind, SplayNode *root){
    SplayNode *now = root;
    while(true){
        int lsize = now->left ? now->left->size : 0;
        if(ind < lsize){
            now = now->left;
        }
        if(ind == lsize){
            now->splay();
            return now;
        }
        if(ind > lsize){
            now = now->right;
            ind -= lsize + 1;
        }
    }
};

pair<SN*, SN*> split(int left_cnt, SN *root){
    if(left_cnt == 0)return {nullptr, root};
    if(left_cnt == root->size)return {root, nullptr};
    root = get(left_cnt, root);
    SN *lroot, *rroot;
    lroot = root->left;
    rroot = root;

    lroot->parent = nullptr;
    rroot->left = nullptr;
    rroot->update();

    return {lroot, rroot};
};

SN* merge(SN *lroot, SN *rroot){
    if(!rroot)return lroot;
    if(!lroot)return rroot;

    rroot = get(0,rroot);
    rroot->left = lroot;
    lroot->parent = rroot;
    rroot->update();
    return rroot;
};

SN* insert(int ind, SN *node, SN* root){
    auto p = split(ind, root);
    SN *lroot = p.first;
    SN *rroot = p.second;
    return merge(merge(lroot, node), rroot);
};

pair<SN*, SN*> remove(int ind, SN *root){
    root = get(ind, root);
    SN *lroot = root->left;
    SN *rroot = root->right;
    if(lroot){
        lroot->parent = nullptr;
        root->left = nullptr;
    }
    if(rroot){
        rroot->parent = nullptr;
        root->right = nullptr;
    }
    root->update();
    return {merge(lroot, rroot), root};
};




int main(){
    ll n,q; cin >> n >> q;
    vector<SplayNode> vec(n+1);
    // debug("test");
    rep(i,n){
        vec[i+1].left = &vec[i];
        vec[i].parent = &vec[i+1];
        vec[i+1].update();
        // debug(i);
    }

    rep(i,n){
        cin >> vec[i].value;
        vec[i].update();
    }

    ll vecsize = 0;
    SplayNode *root = &vec[n-1];
    rep(i,q){
        ll ord; cin >> ord;
        if(ord == 0){
            ll l,r; cin >> l >> r;
            auto trees = remove(r, root);
            root = insert(l, trees.second, trees.first);
        }
        if(ord == 1){
            ll l,r; cin >> l >> r;
            auto trees = split(r+1, root);
            SN* rroot = trees.second;
            trees = split(l, trees.first);
            cout << trees.second->minimum <<"\n";
            root = merge(merge(trees.first, trees.second), rroot);
        }
        if(ord == 2){
            ll pos,val; cin >> pos >> val;
            root = get(pos, root);
            root->value = val;
            root->update();
        }
    }
}


Measured memory_bytes: 12352