#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
#include <new>
#include <typeinfo>
#include <iterator>
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
constexpr ll mop = 1000000007;
constexpr ll mop2 = 998244353;

using namespace std;

constexpr ll NOT_SPECIFIED_VALUE_MIN = INT64_MIN;
constexpr ll NOT_SPECIFIED_VALUE_MAX = INT64_MAX;

class SplayNode {
	SplayNode *parent, *left, *right;
	ll partialTreeSize;
	ll partialTreeMinimum;
	ll value;

public:
	SplayNode() {
		left = nullptr;
		right = nullptr;
		parent = nullptr;
		partialTreeSize = 1;
		partialTreeMinimum = NOT_SPECIFIED_VALUE_MAX;
		value = NOT_SPECIFIED_VALUE_MIN;
	}
	void rotate() {
		SplayNode *p, *pp, *child;
		p = this->parent;
		assert(p != nullptr);
		pp = p->parent;

		if (pp && pp->left == p) {
			pp->left = this;
		}
		if (pp && pp->right == p) {
			pp->right = this;
		}
		this->parent = pp;
		p->parent = this;

		if (p->left == this) {
			child = this->right;
			this->right = p;
			p->left = child;
		}
		else {
			assert(p->right == this);
			child = this->left;
			this->left = p;
			p->right = child;
		}
		if (child) {
			child->parent = p;
		}
		p->updatePartialTree();
		this->updatePartialTree();
	}

	void splay() {
		while (this->whichChild()) {
			if (this->parent->whichChild() == 0) {
				this->rotate();
			}
			else if (this->whichChild() == this->parent->whichChild()) {
				this->parent->rotate();
				this->rotate();
			}
			else {
				this->rotate();
				this->rotate();
			}
		}
	}

	ll whichChild() {
		if (!this->parent) {
			return 0;
		}
		if (this->parent->left == this) {
			return -1;
		}
		if (this->parent->right == this) {
			return 1;
		}
		assert(false);
		return 0;
	}

	void updatePartialTree() {
		updatePartialTreeSize();
		updatePartialTreeMinimum();
	}

	void updatePartialTreeSize() {
		this->partialTreeSize = 1;
		if (this->left) {
			this->partialTreeSize += this->left->partialTreeSize;
		}
		if (this->right) {
			this->partialTreeSize += this->right->partialTreeSize;
		}
	}

	void updatePartialTreeMinimum() {
		this->partialTreeMinimum = this->value;
		if (this->left) {
			this->partialTreeMinimum = min(this->partialTreeMinimum, this->left->partialTreeMinimum);
		}
		if (this->right) {
			this->partialTreeMinimum = min(this->partialTreeMinimum, this->right->partialTreeMinimum);
		}

	}

	SplayNode* getLeft() { return left; }
	SplayNode* getRight() { return right; }
	SplayNode* getParent() { return parent; }
	ll getValue() { return value; }
	ll getPartialTreeSize() { return partialTreeSize; }
	ll getPartialTreeMinimum() { return partialTreeMinimum; }
	void setLeft(SplayNode* l) { left = l; }
	void setRight(SplayNode* r) { right = r; }
	void setParent(SplayNode* p) { parent = p; }
	void setValue(ll val) { value = val; }
	void setPartialTreeSize(ll size) { partialTreeSize = size; }
	void setPartialTreeMinimum(ll val) { partialTreeMinimum = val; }

};

class SplayNodeList {
	vector<SplayNode> m_splayNodeList;
	ll listSize;
public:
	SplayNodeList() {
		this->initialize();
	}
	
	SplayNode* getNode(ll idx, SplayNode* root) { // random access
		SplayNode* now = root;
		while (true) {
			ll lsize = now->getLeft() ? now->getLeft()->getPartialTreeSize() : 0;
			if (idx < lsize) {
				now = now->getLeft();
			}
			if (idx == lsize) {
				now->splay();
				return now;
			}
			if (idx > lsize) {
				now = now->getRight();
				idx = idx - lsize - 1;
			}
		}
	}

	SplayNode* merge(SplayNode* lroot, SplayNode* rroot) {
		if (!lroot)return rroot;
		if (!rroot)return lroot;
		lroot = getNode(lroot->getPartialTreeSize() - 1, lroot);
		lroot->setRight(rroot);
		rroot->setParent(lroot);
		lroot->updatePartialTree();
		return lroot;
	}

	pair<SplayNode*, SplayNode*> split(ll leftCnt, SplayNode* root) {
		if (leftCnt == 0)return { nullptr, root };
		if (leftCnt == root->getPartialTreeSize())return { root, nullptr };
		root = getNode(leftCnt, root);
		SplayNode* lroot = root->getLeft();
		SplayNode* rroot = root;
		rroot->setLeft(nullptr);
		lroot->setParent(nullptr);
		rroot->updatePartialTree();
		return { lroot, rroot };
	}

	SplayNode* insert(ll idx, SplayNode* newNode, SplayNode* root) {
		auto trees = split(idx, root);
		SplayNode* lroot = trees.first;
		SplayNode* rroot = trees.second;
		return merge(merge(lroot, newNode), rroot);
	}

	pair<SplayNode*, SplayNode*> remove(ll idx, SplayNode* root) {
		root = getNode(idx, root);
		SplayNode* lroot = root->getLeft();
		SplayNode* rroot = root->getRight();
		if(lroot) lroot->setParent(nullptr);
		if(rroot) rroot->setParent(nullptr);
		root->setLeft(nullptr);
		root->setRight(nullptr);
		root->updatePartialTree();
		return { merge(lroot, rroot), root };
	}

	SplayNode* shift(ll l, ll r, SplayNode* root) {
		auto tmp = remove(r, root);
		root = tmp.first;
		SplayNode* node = tmp.second;
		return insert(l, node, root);
	}

	pair<SplayNode*, ll> getRMQ(ll l, ll r, SplayNode* root) {
		auto tmp = split(r + 1, root);
		SplayNode* rroot = tmp.second;
		tmp = split(l, tmp.first);
		SplayNode* lroot = tmp.first;
		SplayNode* croot = tmp.second;
		ll ans = croot->getPartialTreeMinimum();
		return { merge(merge(lroot, croot), rroot), ans };
	}

	void initialize() {
		listSize = (1LL << 18);
		m_splayNodeList.resize(listSize);
		for (ll i = 0; i < listSize - 1; i++) {
			m_splayNodeList[i].setParent(&m_splayNodeList[i + 1]);
			m_splayNodeList[i + 1].setLeft(&m_splayNodeList[i]);
			m_splayNodeList[i + 1].updatePartialTree();
		}
	}

	vector<SplayNode>::iterator begin() { return m_splayNodeList.begin(); }
	vector<SplayNode>::iterator end() { return m_splayNodeList.end(); }

};

int main() {
	ll arraySize, Q;
	cin >> arraySize >> Q;
	SplayNodeList nodeList;

	SplayNode* root = &(*(nodeList.end() - 1));

	for (ll i = 0; i < arraySize; i++) {
		ll tmp;
		cin >> tmp;
		root = nodeList.getNode(i, root);
		root->setValue(tmp);
		root->updatePartialTree();
	}

	for (ll q = 0; q < Q; q++) {
		ll com;
		cin >> com;
		if (com == 0) {
			ll l, r;
			cin >> l >> r;
			root = nodeList.shift(l, r, root);
		}
		else if (com == 1) {
			ll l, r;
			cin >> l >> r;
			auto tmp = nodeList.getRMQ(l, r, root);
			root = tmp.first;
			cout << tmp.second << endl;
		}
		else {
			ll pos, val;
			cin >> pos >> val;
			root = nodeList.getNode(pos, root);
			root->setValue(val);
			root->updatePartialTree();
		}
		
	}
}



Measured memory_bytes: 15248