#include <cstdio>
#include <algorithm>
#include <cassert>
using namespace std;

const int INF = int(1.05e9); 

class Random {
private:
	unsigned int x, y, z, w, t;
public:
	unsigned int rand(){
		t = x ^ (x << 11);
		x = y; y = z; z = w;
		return w = ( (w ^ (w>>19)) ^ (t ^ (t>>8)));
	}


	Random():x(123456789U), y(362436069U), z(521288629U), w(88675123U) {
		for (int _ = 0; _ < 538; ++_) {
			rand();
		}
	}

	Random(unsigned int w_):x(123456789U), y(362436069U), z(521288629U), w(w_) {
		for (int _ = 0; _ < 538; ++_) {
			rand();
		}
	}
};

Random rnd;

typedef unsigned int uint;

template<class T>
struct Node {
	T value, mini;
	Node *child[2];
	uint priority;
	int size;

	Node(){}
	Node(T val, uint pri):
		value(val), mini(val), priority(pri), size(1)
	{
		child[0] = child[1] = 0;
	}
};

template<class T>
inline Node<T> *allocateNode(T value, uint priority) {
	assert(0);
	return new Node<T>(value, priority);
}

template<class T>
inline void freeNode(Node<T> *node) {
	assert(0);
	free(node);
}

template<class T>
inline int getSize(Node<T> *r) {
	return !r ? 0 : r->size;
}

template<class T>
inline Node<T> *getNode(Node<T>* r, int k) {
	int left = getSize(r->child[0]), which = (k > left);
	if (left == k) {
		return r;
	}
	return getNode(r->child[which], k - (which ? (left + 1) : 0));
}

template<class T>
inline Node<T> *update(Node<T> *r) {
	r->size = getSize(r->child[0]) + getSize(r->child[1]) + 1;
	r->mini = r->value;
	for (int i = 0; i < 2; ++i) if (r->child[i]) {
		r->mini = min(r->mini, r->child[i]->mini);
	}
	return r;
}

template<class T>
inline Node<T> *updateValue(Node<T> *r, int k, T val) {
	int left = getSize(r->child[0]), which = (k > left);
	if (left == k) {
		r->value = val;
		return update(r);
	}
	if (r->child[which]) {
		r->child[which] = updateValue(r->child[which], k - (which ? (left + 1) : 0), val);
	}
	return update(r);
}

template<class T>
inline T queryValue(Node<T> *r, int from, int to) {
	if (to <= from) {
		return INF;
	}
	if (to - from == getSize(r)) {
		return r->mini;
	}
	int left = getSize(r->child[0]);
	if (to <= left) {
		return queryValue(r->child[0], from, to);
	}
	if (left < from) {
		return queryValue(r->child[1], from - left - 1, to - left - 1);
	}
	return min(r->value,
			min(queryValue(r->child[0], from ,left),
				queryValue(r->child[1], 0, to - left - 1)));
}

template<class T>
inline Node<T> *rotate(Node<T> *r, int which) { 
	Node<T> *opposite = r->child[which^1];
	r->child[which^1] = opposite->child[which];
	opposite->child[which] = r;
	update(r);
	update(opposite);
	return opposite;
}

/*
template<class T>
inline Node<T> *insert(Node<T> *r, int k, T value, uint priority) {
	if (!r) {
		assert(k == 0);
		return allocateNode(value, priority);
	}
	assert(0 <= k && k <= r->size);
	int left = getSize(r->child[0]), which = (k > left);
	r->child[which] = insert(r->child[which], k - (which ? (left + 1) : 0), value, priority);
	update(r);
	if (r->priority > r->child[which]->priority) {
		r = rotate(r, which^1);
	}
	return r;
}

template<class T>
inline Node<T> *insert(Node<T> *r, int k, T value) {
	return insert(r, k, value, rnd.rand());
}

template<class T>
inline Node<T> *erase(Node<T> *r, int k) {
	assert(r);
	if (r->size == 1) {
		assert(k == 0);
		freeNode(r);
		return 0;
	}
	int left = getSize(r->child[0]), which = (k > left);
	if (left == k) {
		r = rotate(r, left > 0);
		return erase(r, k);
	}
	r->child[which] = erase(r->child[which], k - (which ? (left + 1) : 0));
	update(r);
	return r;
}
*/

template<class T>
inline Node<T> *merge(Node<T> *left, Node<T> *right) {
	if (!left || !right) {
		return !left ? right : left;
	}
	if (left->priority > right->priority) {
		left->child[1] = merge(left->child[1], right);
		return update(left);
	}
	else {
		right->child[0] = merge(left, right->child[0]);
		return update(right);
	}
}

template<class T>
inline pair<Node<T>*, Node<T>*> split(Node<T> *r, int k) {
	if (!r) {
		return pair<Node<T>*, Node<T>*>(0, 0);
	}
	const int left = getSize(r->child[0]);
	if (k <= left) {
		pair<Node<T>*, Node<T>* > ret = split(r->child[0], k);
		r->child[0] = ret.second;
		return make_pair(ret.first, update(r));
	}
	else {
		pair<Node<T>*, Node<T>* > ret = split(r->child[1], k - (left + 1));
		r->child[1] = ret.first;
		return make_pair(update(r), ret.second);
	}
}

template<class T>
inline void freeAllNode(Node<T> *r) {
	if (r) {
		freeAllNode(r->child[0]);
		freeAllNode(r->child[1]);
		freeNode(r);
	}
}

template<class T>
inline Node<T> *insert(Node<T> *r, int k, T value) {
	pair<Node<T>*, Node<T>*> sp = split(r, k);
	return merge(merge(sp.first, allocateNode(value, rnd.rand())), sp.second);
}

template<class T>
inline Node<T> *shift(Node<T>* r, int y, int z) {
	pair<Node<T>*, Node<T>*> r1 = split(r, z+1), r2 = split(r1.first, z), r3 = split(r2.first, y);
	return merge(merge(r3.first, r2.second), merge(r3.second, r1.second));
}


const int MAX_NODE = 400000;
Node<int> nodes__[MAX_NODE];
int freeNodeStack__[MAX_NODE], *lastStack__;

void initNode(int n = MAX_NODE) {
	for (int i = 0; i < n; ++i) {
		freeNodeStack__[i] = n - 1 - i;
	}
	lastStack__ = freeNodeStack__ + n;
}

template<>
inline Node<int> *allocateNode(int value, uint priority) {
	return &(nodes__[*--lastStack__] = Node<int>(value, priority));
}

template<>
inline void freeNode(Node<int> *node) {
	assert(node);
	if (node) {
		*lastStack__ = int(node - nodes__);
		++lastStack__;
	}
}

int main() {
	initNode();
	rnd.rand();
	for (int n, q, x, y, z; scanf("%d%d", &n, &q) == 2;) {
		Node<int> *tp = 0;
		for (int i = 0; i < n; ++i) {
			int a; scanf("%d", &a);
			tp = insert(tp, i, a);
		}
		for (int _ = 0; _ < q; ++_) {
			scanf("%d%d%d", &x, &y, &z);
			if (x == 0) {
				/*
				int tmp = getNode(tp, z)->value;
				tp = erase(tp, z);
				tp = insert(tp, y, tmp);
				*/
				tp = shift(tp, y, z);
			}
			else if (x == 1) {
				printf("%d\n", queryValue(tp, y, z+1));
			}
			else if (x == 2) {
				tp = updateValue(tp, y, z);
			}
		}
		break;
	}
	return 0;
}

Measured memory_bytes: 9216