#include <bits/stdc++.h>
using namespace std;

int id = INT_MAX;
int merge(int l, int r) {
	return min(l, r);
}

struct node {
	int val;
	int all;
	node *ch[2];
	unsigned int pri;
	int size;
	node(int v, unsigned int p) : val(v), all(v), pri(p), size(1) {
		ch[0] = ch[1] = nullptr;
	}
};

random_device rd;

int count(node *t) { return t == nullptr ? 0 : t->size; }
int que(node *t) { return t == nullptr ? id : t->all; }
node *update(node *t) {
	t->size = count(t->ch[0]) + count(t->ch[1]) + 1;
	t->all = merge(que(t->ch[0]), merge(t->val, que(t->ch[1])));
	return t;
}
node *rotate(node *t, int b) {
	node *s = t->ch[1 - b];
	t->ch[1 - b] = s->ch[b];
	s->ch[b] = t;
	update(t); update(s);
	return s;
}
node *insert(node *t, int k, int v, unsigned int pri) {
	if (t == nullptr) return new node(v, pri);
	int c = count(t->ch[0]), b = (k > c);
	t->ch[b] = insert(t->ch[b], k - (b ? (c + 1) : 0), v, pri);
	update(t);
	if (t->pri > t->ch[b]->pri) t = rotate(t, 1 - b);
	return t;
}
node *erase(node *t) {
	if (t == nullptr) return nullptr;
	if (t->ch[0] == nullptr && t->ch[1] == nullptr) {
		delete t;
		return nullptr;
	}
	int b = (t->ch[0] != nullptr && t->ch[1] != nullptr) ? (t->ch[0]->pri > t->ch[1]->pri) : (t->ch[0] != nullptr);
	t = rotate(t, b);
	t->ch[b] = erase(t->ch[b]);
	update(t);
	return t;
}
node *erase(node *t, int k) {
	if (t == nullptr) return nullptr;
	int c = count(t->ch[0]);
	if (k < c) {
		t->ch[0] = erase(t->ch[0], k);
		update(t);
	}
	else if (k > c) {
		t->ch[1] = erase(t->ch[1], k - (c + 1));
		update(t);
	}
	else {
		t = erase(t);
	}
	return t;
}
node *merge(node *l, node *r) {
	node *p = new node(0, 0);
	p->ch[0] = l, p->ch[1] = r;
	p = erase(p);
	return p;
}
pair<node*, node*> split(node *t, int k) {
	if (t == nullptr) return make_pair(nullptr, nullptr);
	node *p = insert(t, k, 0, 0);
	auto res = make_pair(p->ch[0], p->ch[1]);
	delete p;
	return res;
}
int find(node *t, int l, int r) {
	if (t == nullptr) return id;
	if (r < 0 || l >= count(t)) return id;
	if (l <= 0 && r >= t->size) return t->all;
	int c = count(t->ch[0]);
	return merge(t->ch[0] == nullptr ? id : find(t->ch[0], l, r), merge(l <= c && c < r ? t->val : id, t->ch[1] == nullptr ? id : find(t->ch[1], l - (c + 1), r - (c + 1))));
}
node *find(node *t, int k) {
	if (t == nullptr) return t;
	int c = count(t->ch[0]);
	return k < c ? find(t->ch[0], k) : k == c ? t : find(t->ch[1], k - (c + 1));
}
int cnt(node *t, int v) {
	if (t == nullptr) return 0;
	if (t->val < v) return count(t->ch[0]) + 1 + cnt(t->ch[1], v);
	if (t->val == v) return count(t->ch[0]);
	return cnt(t->ch[0], v);
}
void print(node *t) {
	if (t == nullptr) return;
	print(t->ch[0]);
	printf(" %d", t->val);
	print(t->ch[1]);
}

node *shift(node *t, int l, int r) {
	pair<node*, node*> s1 = split(t, l), s2 = split(s1.second, r - l), s3 = split(s2.second, 1);
	return merge(s1.first, merge(s3.first, merge(s2.first, s3.second)));
}
void change(node *t, int k, int v) {
	if (t == nullptr) return;
	int c = count(t->ch[0]);
	if (k < c) {
		change(t->ch[0], k, v);
		update(t);
	}
	else if (k > c) {
		change(t->ch[1], k - (c + 1), v);
		update(t);
	}
	else {
		t->val = v;
		update(t);
	}
}

int main()
{
	cin.sync_with_stdio(false);
	int n, q, x, y, z;
	cin >> n >> q;
	node *root = nullptr;
	for (int i = 0, a; i < n; i++) {
		cin >> a;
		root = insert(root, i, a, rd());
	}
	while (q--) {
		cin >> x >> y >> z;
		if (x == 0) {
			root = shift(root, y, z);
		}
		else if (x == 1) {
			printf("%d\n", find(root, y, z + 1));
		}
		else {
			change(root, y, z);
		}
	}
	return 0;
}

Measured memory_bytes: 12676