#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <ctime>
#include <random>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

mt19937 mt_rand(time(NULL));
using Value = int;

struct Treap {
  Value v;
  int cnt;
  int p;
  int seg_min;
  Treap *ch[2];
  Treap(Value v) : v(v), p(mt_rand()) {
    cnt = 1;
    seg_min = v;
    ch[0] = ch[1] = NULL;
  };
};
inline int count(Treap *t) { return t ? t->cnt : 0; }
inline int seg_min(Treap *t) { return t ? t->seg_min : INF; }
Treap *update(Treap *t) {
  if (t == NULL) return t;
  t->cnt = count(t->ch[0]) + count(t->ch[1]) + 1;
  t->seg_min = min({ seg_min(t->ch[0]), seg_min(t->ch[1]), t->v });
  return t;
}
Treap *merge(Treap *l, Treap *r) {
  if (l == NULL) return r;
  if (r == NULL) return l;
  if (l->p > r->p) {
    l->ch[1] = merge(l->ch[1], r);
    return update(l);
  }
  else {
    r->ch[0] = merge(l, r->ch[0]);
    return update(r);
  }
}

// [0, k), [k, n)
pair<Treap *, Treap *> split(Treap *t, int k) {
  if (t == NULL) return {NULL, NULL};
  if (k <= count(t->ch[0])) {
    auto s = split(t->ch[0], k);
    t->ch[0] = s._2;
    return { s._1, update(t) };
  }
  else {
    auto s = split(t->ch[1], k - count(t->ch[0]) - 1);
    t->ch[1] = s._1;
    return { update(t), s._2 };
  }
}

Treap *insert(Treap *t, int k, Value v) {
  Treap *l, *r;
  tie(l, r) = split(t, k);
  Treap *u = new Treap(v);
  return merge(merge(l, u), r);
}

pair<Treap *, Treap *> erase(Treap *t, int k) {
  Treap *l, *r, *u;
  tie(l, r) = split(t, k+1);
  tie(l, u) = split(l, k);
  return { merge(l, r), u };
}

int count_less(Treap *t, int x) {
  if (t == NULL) return 0;
  if (t->v <= x) {
    return count(t->ch[0]) + 1 + count_less(t->ch[1], x);
  }
  else {
    return count_less(t->ch[0], x);
  }
}
Treap *get(Treap *t, int k) {
  int l = count(t->ch[0]);
  if (k < l) return get(t->ch[0], k);
  if (k > l) return get(t->ch[1], k-l-1);
  return t;
}
void update_ancestor(Treap *t, int n) {
  int l = count(t->ch[0]);
  if (n < l) update_ancestor(t->ch[0], n);
  if (n > l) update_ancestor(t->ch[1], n-l-1);
  update(t);
}
Treap *shift(Treap *t) {
  if (t == NULL) return NULL;
  Treap *u;
  tie(t, u) = split(t, count(t)-1);
  return merge(u, t);
}

int N, Q;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> Q;

  Treap *treap = NULL;
  rep(i, N) {
    int a; cin >> a;
    treap = insert(treap, i, a);
  }

  rep(i, Q) {
    int t, a, b;
    cin >> t >> a >> b;
    if (t == 0) {
      // shift [a, b]
      Treap *l, *u, *r;
      tie(l, r) = split(treap, b+1);
      tie(l, u) = split(l, a);
      u = shift(u);
      assert(count(u) == b-a+1);
      treap = merge(merge(l, u), r);
    }
    else if (t == 1) {
      // min [a, b]
      Treap *l, *u, *r;
      tie(l, r) = split(treap, b+1);
      tie(l, u) = split(l, a);
      assert(count(u) == b-a+1);
      cout << seg_min(u) << "\n";
      treap = merge(merge(l, u), r);
    }
    else {
      // update(a, b)
      get(treap, a)->v = b;
      update_ancestor(treap, a);
    }
  }
  return 0;
}

Measured memory_bytes: 12540