#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<int, ll> i_ll;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v; ll w; };

const int MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
ll INF = LLONG_MAX / 3;

struct dice {
	mt19937 mt;
	dice() {
		random_device rd;
		mt = mt19937(rd());
	}
	int operator()(int x) { return this->operator()(0, x - 1); }
	int operator()(int x, int y) {
		uniform_int_distribution<int> dist(x, y);
		return dist(mt);
	}
} dc;

struct urara {
	urara *lch, *rch;
	int d, val;
	urara(int _val = 0) : lch(NULL), rch(NULL), d(1), val(_val) {}
};
typedef pair<urara*, urara*> P;

urara* update(urara* x) {
	x->d = x->lch->d + x->rch->d;
	x->val = min(x->lch->val, x->rch->val);
	return x;
}

urara* merge(urara* x, urara* y) {
	if (!x) return y;
	if (!y) return x;
	int m = dc(1, x->d + y->d - 1);
	if (m < x->d) {
		x->rch = merge(x->rch, y);
		return update(x);
	}
	else if (m > x->d) {
		y->lch = merge(x, y->lch);
		return update(y);
	}
	else {
		urara *z = new urara();
		z->lch = x;
		z->rch = y;
		return update(z);
	}
}

urara* merge(vector<urara*> xs) {
	urara* x = NULL;
	for (urara* y : xs) x = merge(x, y);
	return x;
}

P split(urara* x, int m) {
	if (m == 0) return P(NULL, x);
	if (m == x->d) return P(x, NULL);
	int ld = x->lch->d;
	if (m < ld) {
		P p = split(x->lch, m);
		x->lch = p.second;
		return P(p.first, update(x));
	}
	else if (m > ld) {
		P p = split(x->rch, m - ld);
		x->rch = p.first;
		return P(update(x), p.second);
	}
	else {
		P p(x->lch, x->rch);
		delete x;
		return p;
	}
}

vector<urara*> split(urara* x, vector<int> is) {
	reverse(is.begin(), is.end());
	vector<urara*> xs;
	for (int i : is) {
		P p = split(x, i);
		x = p.first;
		xs.pb(p.second);
	}
	xs.pb(x);
	reverse(xs.begin(), xs.end());
	return xs;
}

int get_min(urara* x, int l, int r) {
	if (!x || r <= 0 || x->d <= l) return INT_MAX;
	if (l <= 0 && x->d <= r) return x->val;
	int ld = x->lch->d;
	return min(get_min(x->lch, l, r), get_min(x->rch, l - ld, r - ld));
}

void set_val(urara* x, int i, int val) {
	if (x->d == 1) { x->val = val; return; }
	int ld = x->lch->d;
	if (i < ld) set_val(x->lch, i, val);
	else set_val(x->rch, i - ld, val);
	update(x);
}

int main() {
	int N, Q; cin >> N >> Q;
	vector<int> a(N);
	rep(i, N) scanf("%d", &a[i]);
	urara* x = NULL;
	rep(i, N) x = merge(x, new urara(a[i]));
	while (Q--) {
		int q; scanf("%d", &q);
		if (q == 0) {
			int l, r; scanf("%d%d", &l, &r); r++;
			vector<urara*> xs = split(x, { l, r - 1, r });
			swap(xs[1], xs[2]);
			x = merge(xs);
		}
		if (q == 1) {
			int l, r; scanf("%d%d", &l, &r); r++;
			printf("%d\n", get_min(x, l, r));
		}
		if (q == 2) {
			int i, val; scanf("%d%d", &i, &val);
			set_val(x, i, val);
		}
	}
}

Measured memory_bytes: 16208