#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

struct AVL {
	struct Node {
		Node *l;
		Node *r;
		int height;
		int size;
		int val;
		int min;
		Node *fetch() {
			size = 1 + l->size + r->size;
			height = 1 + std::max(l->height, r->height);
			min = std::min({l->min, r->min, val});
			return this;
		}
		Node *rotate_l() {
			Node *new_root = r;
			r = new_root->l;
			new_root->l = this;
			return fetch(), new_root->fetch();
		}
		Node *rotate_r() {
			Node *new_root = l;
			l = new_root->r;
			new_root->r = this;
			return fetch(), new_root->fetch();
		}
		int height_diff() { return l->height - r->height; }
		Node *balance() {
			int dif = height_diff();
			if (dif == 2) {
				if (l->height_diff() < 0) l = l->rotate_l();
				return rotate_r();
			} else if (dif == -2) {
				if (r->height_diff() > 0) r = r->rotate_r();
				return rotate_l();
			} else return fetch();
		}
	};
	static Node *nodes, *NONE, *removed_tmp;
	static int head;
	Node *root = NONE;
	AVL () {
		if (!head) nodes[head++] = {NONE, NONE, 0, 0, 0, 1000000000};
	}
	Node *insert(Node *node, int index, int val) {
		if (node == NONE) return &(nodes[head++] = {NONE, NONE, 1, 1, val, val});
		int lsize = node->l->size;
		if (index <= lsize) node->l = insert(node->l, index, val);
		else node->r = insert(node->r, index - lsize - 1, val);
		return node->balance();
	}
	Node *remove_rightest(Node *node) {
		if (node->r != NONE) {
			node->r = remove_rightest(node->r);
			return node->balance();
		} else return (removed_tmp = node)->l;
	}
	Node *remove(Node *node, int index) {
		int lsize = node->l->size;
		if (index < lsize) node->l = remove(node->l, index);
		else if (index > lsize) node->r = remove(node->r, index - lsize - 1);
		else {
			if (node->l == NONE) return node->r;
			node->l = remove_rightest(node->l);
			removed_tmp->l = node->l;
			removed_tmp->r = node->r;
			return removed_tmp->balance();
		}
		return node->balance();
	}
	Node *assign(Node *node, int index, int val) {
		int lsize = node->l->size;
		if (index < lsize) node->l = assign(node->l, index, val);
		else if (index > lsize) node->r = assign(node->r, index - lsize - 1, val);
		else node->val = val;
		return node->fetch();
	}
	int min(Node *node, int l, int r) {
		if (l <= 0 && r >= node->size) return node->min;
		int res = 1000000000;
		int lsize = node->l->size;
		if (l <= lsize && r > lsize) res = node->val;
		if (l < lsize && node->l != NONE) res = std::min(res, min(node->l, l, r));
		if (r > lsize + 1 && node->r != NONE) res = std::min(res, min(node->r, l - lsize - 1, r - lsize - 1));
		return res;
	}
	
	void insert(int index, int val) { root = insert(root, index, val); }
	void remove(int index) { root = remove(root, index); }
	void assign(int index, int val) { root = assign(root, index, val); }
	int min(int l, int r) { return min(root, l, r); }
};
AVL::Node *AVL::nodes = (Node *) malloc(sizeof(Node) * 1000000), *AVL::NONE = nodes, *AVL::removed_tmp;
int AVL::head = 0;

int main() {
	int n = ri(), q = ri();
	int a[n];
	for (int i = 0; i < n; i++) a[i] = ri();
	AVL tree;
	for (int i = 0; i < n; i++) tree.insert(i, a[i]);
	for (int i = 0; i < q; i++) {
		int t = ri();
		int x = ri();
		int y = ri();
		if (t == 0) {
			int tmp = tree.min(y, y + 1);
			tree.remove(y);
			tree.insert(x, tmp);
		} else if (t == 1) {
			printf("%d\n", tree.min(x, y + 1));
		} else if (t == 2) tree.assign(x, y);
	}
	return 0;
}




Measured memory_bytes: 16528