#include <bits/stdc++.h>
using key_t = int;
const key_t INF = 1000000000;
const int MAX_N = 1000010;  // ?????\??????????° + EPS

uint32_t xor128() {
    static uint32_t x = 123456789, y = 362436069, z = 521288629, w = time(0);
    uint32_t t = x ^ (x << 11);
    x = y;
    y = z;
    z = w;
    w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
    return w;
}

struct node {
    union {
        key_t key;
        node *ch[2];
    };
    int size;
    key_t min;

    static node *const nil;

    node() {}

    node(const key_t &x) : key(x), size(1), min(x) {}

    node(node *left_, node *right_, int size_, const key_t &min_)
        : size(size_), min(min_) {
        ch[0] = left_;
        ch[1] = right_;
    }

    void *operator new(std::size_t) {
        static node pool[MAX_N];
        static int p = 0;
        return pool + p++;
    }

    bool is_leaf() const {
        return size == 1;
    }
};

using np = node *;
using cnp = const node *;
using npair = std::pair<np, np>;

node *const node::nil = new node(nullptr, nullptr, 0, INF);

class rbst {
public:
    np root;

    rbst() : root(node::nil) {}

    rbst(np root_) : root(root_) {}

    rbst(key_t *left, key_t *right) : root(make_tree_rec(left, right)) { }

    np make_tree_rec(key_t *left, key_t *right) {
        int sz = right - left;
        key_t *mid = left + sz / 2;
        if (sz == 0){
            return node::nil;
        } else if (sz == 1) {
            return new node(*mid);
        } else {
            np lc = make_tree_rec(left, mid);
            np rc = make_tree_rec(mid, right);
            return new node(lc, rc, sz, std::min(lc->min, rc->min));
        }
    }

    int size() const { return root->size; }

    void set(int k, const key_t &x) { set(root, k, x); }

    void set(np n, int k, const key_t &x) {
        if (n->is_leaf()) {
            n->key = n->min = x;
        } else {
            if (k < n->ch[0]->size) set(n->ch[0], k, x);
            else set(n->ch[1], k - n->ch[0]->size, x);
            update(n);
        }
    }

    key_t get(int k) const { return __get(root, k); }

    key_t __get(np n, int k) const {
        if (n->size == 1) return n->key;
        else if (k < n->ch[0]->size) return __get(n->ch[0], k);
        else return __get(n->ch[1], k - n->ch[0]->size);
    }

    key_t range_min(int l, int r) { return range_min(root, l, r); }

    key_t range_min(cnp n, int l, int r) const {
        l = std::max(l, 0);
        r = std::min(r, n->size);
        if (l >= r) return INF;
        if (l == 0 && r == n->size) return n->min;
        key_t res = INF;
        int sl = n->ch[0]->size;
        res = std::min(res, range_min(n->ch[0], l, r));
        res = std::min(res, range_min(n->ch[1], l - sl, r - sl));
        return res;
    }

    np merge(np l, np r) const {
        if(l == node::nil) return r;
        if(r == node::nil) return l;
        return merge_sub(l, r);
    }

    np merge_sub(np l, np r) const {
        int sl = l->size, sr = r->size;
        int rand = xor128() % (sl + sr + 1);
        if (rand < sl){
            if(l->is_leaf()) return new node(l, r, l->size + r->size, std::min(l->min, r->min));
            l->ch[1] = merge_sub(l->ch[1], r);
            return update(l);
        } else if(rand == sl) {
            return new node(l, r, l->size + r->size, std::min(l->min, r->min));
        } else {
            if(r->is_leaf()) return new node(l, r, l->size + r->size, std::min(l->min, r->min));
            r->ch[0] = merge_sub(l, r->ch[0]);
            return update(r);
        }
    }

    std::pair<rbst, rbst> split_at(int k) {
        np l, r;
        std::tie(l, r) = split_at(root, k);
        return std::make_pair(rbst(l), rbst(r));
    }

    npair split_at(np n, int k) const {
        if(n == node::nil) return npair(node::nil, node::nil);
        else return split_at_sub(n, k);
    }

    npair split_at_sub(np n, int k) const {
        if (n->is_leaf()) return k == 0 ? npair(node::nil, n) : npair(n, node::nil);
        if (k < n->ch[0]->size) {
            npair p = split_at_sub(n->ch[0], k);
            n->ch[0] = p.second;
            return npair(p.first, update(n));
        }
        if (k == n->ch[0]->size) return npair(n->ch[0], n->ch[1]);
        npair p = split_at_sub(n->ch[1], k - n->ch[0]->size);
        n->ch[1] = p.first;
        return npair(update(n), p.second);
    }

    np update(np n) const {
        // assert(n->ch[0] != node::nil);
        n->size = n->ch[0]->size + n->ch[1]->size;
        n->min = std::min(n->ch[0]->min, n->ch[1]->min);
        return n;
    }

    void shift(int l, int r) {
        np a, b, c, d;
        std::tie(a, b) = split_at(root, l);
        std::tie(b, c) = split_at(b, r - l);
        std::tie(c, d) = split_at(c, 1);
        np ac = merge(a, c);
        np bd = merge(b, d);
        root = merge(ac, bd);
    }
};

using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n, q;
    cin >> n >> q;

    static int a[200010];
    for (int i = 0; i < n; i++) cin >> a[i];
    rbst t(a, a + n);

    for (int i = 0; i < q; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        if (x == 0) {
            t.shift(y, z);
        }
        if (x == 1) {
            cout << t.range_min(y, z + 1) << '\n';
        }
        if (x == 2) {
            t.set(y, z);
        }
    }
}

Measured memory_bytes: 22596