#define NDEBUG
#include <algorithm>
#include <cassert>
#include <ctime>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
#define dump(x) std::cerr << __LINE__ << ":\t" #x " = " << x << std::endl

int32_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 & 0x3FFFFFFF;
}

using key_t = int;
const key_t INF = 1000000000;
const int MAX_N = 5000010;
enum { L, R };
struct node {
  key_t key;
  node *ch[2];
  int size;
  key_t min;

  static node *const nil;

  node() : node(0) {}

  node(const key_t &x) : key(x), size(1), min(x) { ch[L] = ch[R] = node::nil; }

  node(node *left_, node *right_, int size_, const key_t &min_)
      : size(size_), min(min_) {
    ch[L] = left_;
    ch[R] = 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);

struct rbst {
  np root;

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

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

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

  np make_tree(key_t *left, key_t *right) {
    int sz = right - left;
    key_t *mid = left + sz / 2;
    if (sz == 0) {
      return node::nil;
    } else {
      np par = new node(*mid);
      par->ch[L] = make_tree(left, mid);
      par->ch[R] = make_tree(mid + 1, right);
      return update(par);
    }
  }

  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 (k < n->ch[L]->size)
      set(n->ch[L], k, x);
    else if (n->ch[L]->size == k)
      n->key = x;
    else {
      set(n->ch[R], k - n->ch[L]->size - 1, x);
    }
    update(n);
  }

  key_t get(cnp n, int k) const {
    if (k < n->ch[L]->size)
      return get(n->ch[L], k);
    else if (n->ch[L]->size == k)
      return n->key;
    else
      return get(n->ch[R], k - n->ch[L]->size - 1);
  }

  key_t range_min(int l, int r) const { 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 - 1, r - sl - 1));
    if (l <= sl && sl < r)
      res = std::min(res, n->key);
    return res;
  }

  np merge(np l, np r) const {
    if (l == node::nil)
      return r;
    if (r == node::nil)
      return l;
    int sl = l->size, sr = r->size;
    if (xor128() % (sl + sr) < sl) {
      l->ch[R] = merge(l->ch[R], r);
      return update(l);
    } else {
      r->ch[L] = merge(l, r->ch[L]);
      return update(r);
    }
  }

  npair split(np n, int k) const {
    if (n == node::nil)
      return {node::nil, node::nil};
    if (k <= n->ch[L]->size) {
      npair p = split(n->ch[L], k);
      n->ch[L] = p.second;
      return npair(p.first, update(n));
    } else {
      npair p = split(n->ch[R], k - n->ch[L]->size - 1);
      n->ch[R] = p.first;
      return npair(update(n), p.second);
    }
  }

  np insert(np n, int k, const key_t &x) const {
    if (n == node::nil)
      return new node(x);
    if (k <= n->ch[L]->size)
      n->ch[L] = insert(n->ch[L], k, x);
    else
      n->ch[R] = insert(n->ch[R], k - n->ch[L]->size - 1, x);
    n = update(n);
    int sl = n->ch[L]->size, sr = n->ch[R]->size;
    int rand = xor128() % (sl + sr);
    return rand < sl ? rotate<R>(n) : rotate<L>(n);
  }

  np erase(np n, int k) const {
    assert(n != node::nil);
    if (n == node::nil)
      return node::nil;
    if (k < n->ch[L]->size)
      n->ch[L] = erase(n->ch[L], k);
    else if (k == n->ch[L]->size)
      return erase(n);
    else
      n->ch[R] = erase(n->ch[R], k - n->ch[L]->size - 1);
    return update(n);
  }

  np erase(np n) const {
    assert(n != node::nil);
    if (n->ch[L] == node::nil)
      return n->ch[R];
    if (n->ch[R] == node::nil)
      return n->ch[L];
    int sl = n->ch[L]->size, sr = n->ch[R]->size;
    int rand = xor128() % (sl + sr);
    if (rand < sl) {
      n = rotate<R>(n);
      n->ch[R] = erase(n->ch[R]);
    } else {
      n = rotate<L>(n);
      n->ch[L] = erase(n->ch[L]);
    }
    return update(n);
  }

  template <int dir> np rotate(np n) const {
    np par = n->ch[1 - dir];
    n->ch[1 - dir] = par->ch[dir];
    par->ch[dir] = update(n);
    return update(par);
  }

  np update(np n) const {
    n->size = n->ch[L]->size + n->ch[R]->size + 1;
    n->min = std::min({n->ch[L]->min, n->ch[R]->min, n->key});
    return n;
  }

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

  void shift_erase_insert(int l, int r) {
    key_t x = get(root, r);
    root = erase(root, r);
    root = insert(root, l, x);
  }
};

using namespace std;
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);
  rbst u(a, a + n);

  for (int i = 0; i < q; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    if (x == 0) {
      t.shift_split_merge(y, z);
      u.shift_erase_insert(y, z);
    }
    if (x == 1) {
      int a = t.range_min(y, z + 1);
      int b = u.range_min(y, z + 1);
      if (a != b)
        throw 0;
      cout << a << '\n';
    }
    if (x == 2) {
      t.set(y, z);
      u.set(y, z);
    }
  }
}

Measured memory_bytes: 160244