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

int id = INT_MAX;
int id2 = -1;
int merge(int l, int r) {
	return min(l, r);
}
int merge2(int l, int r) {
	return r == id2 ? l : r;
}

template <typename T>
struct node {
	T val, all, lazy;
	node<T> *ch[2];
	int size;
	node(T v, node<T> *l = nullptr, node<T> *r = nullptr) : val(v), all(v), lazy(id2), size(1) {
		ch[0] = l; ch[1] = r;
	}
};

template <typename T>
int count(node<T> *t) { return t == nullptr ? 0 : t->size; }
template <typename T>
T que(node<T> *t) { return t == nullptr ? id : merge2(t->all, t->lazy); }
template <typename T>
node<T> *update(node<T> *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;
}
template <typename T>
node<T> *push(node<T> *t) {
	if (t == nullptr || t->lazy == id2) return t;
	if (t->ch[0] != nullptr) {
		t->ch[0]->lazy = merge2(t->ch[0]->lazy, t->lazy);
	}
	if (t->ch[1] != nullptr) {
		t->ch[1]->lazy = merge2(t->ch[1]->lazy, t->lazy);
	}
	t->val = merge2(t->val, t->lazy);
	t->all = merge(que(t->ch[0]), merge(t->val, que(t->ch[1])));
	t->lazy = id2;
	return t;
}
template <typename T>
node<T> *rotate(node<T> *t, int b) {
	node<T> *s = t->ch[1 - b];
	t = push(t);
	s = push(s);
	t->ch[1 - b] = s->ch[b];
	s->ch[b] = t;
	update(t); update(s);
	return s;
}
template <typename T>
node<T> *splay(node<T> *t, int k) {
	assert(t != nullptr && k < count(t));
	t = push(t);
	int c = count(t->ch[0]);
	if (k < c) {
		int cc = count(t->ch[0]->ch[0]);
		if (k < cc) {
			t->ch[0] = push(t->ch[0]);
			t->ch[0]->ch[0] = splay(t->ch[0]->ch[0], k);
			t = rotate(t, 1);
			t = rotate(t, 1);
		}
		else if (k > cc) {
			t->ch[0] = push(t->ch[0]);
			t->ch[0]->ch[1] = splay(t->ch[0]->ch[1], k - (cc + 1));
			t->ch[0] = rotate(t->ch[0], 0);
			t = rotate(t, 1);
		}
		else {
			t = rotate(t, 1);
		}
	}
	else if (k > c) {
		k -= c + 1;
		int cc = count(t->ch[1]->ch[0]);
		if (k < cc) {
			t->ch[1] = push(t->ch[1]);
			t->ch[1]->ch[0] = splay(t->ch[1]->ch[0], k);
			t->ch[1] = rotate(t->ch[1], 1);
			t = rotate(t, 0);
		}
		else if (k > cc) {
			t->ch[1] = push(t->ch[1]);
			t->ch[1]->ch[1] = splay(t->ch[1]->ch[1], k - (cc + 1));
			t = rotate(t, 0);
			t = rotate(t, 0);
		}
		else {
			t = rotate(t, 0);
		}
	}
	t = push(t);
	return t;
}
template <typename T>
node<T> *merge(node<T> *l, node<T> *r) {
	if (l == nullptr || r == nullptr) return l == nullptr ? r : l;
	l = splay(l, count(l) - 1);
	l->ch[1] = r;
	update(l);
	return l;
}
template <typename T>
pair<node<T>*, node<T>*> split(node<T> *t, int k) {
	if (t == nullptr) return make_pair(nullptr, nullptr);
	if (k >= count(t)) return make_pair(t, nullptr);
	t = splay(t, k);
	auto s = t->ch[0];
	t->ch[0] = nullptr;
	return make_pair(s, update(t));
}
template <typename T>
node<T> *insert(node<T> *t, int k, T v) {
	pair<node<T>*, node<T>*> s = split(t, k);
	node<T> *r = merge(s.first, new node<T>(v));
	r = merge(r, s.second);
	return r;
}
template <typename T>
node<T> *erase(node<T> *t, int k) {
	pair<node<T>*, node<T>*> s1 = split(t, k), s2 = split(s1.second, 1);
	if (s2.first != nullptr) delete s2.first;
	return merge(s1.first, s2.second);
}
template <typename T>
T find(node<T> *t, int l, int r) {
	if (t == nullptr) return id;
	if (r < 0 || l >= count(t)) return id;
	t = push(t);
	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))));
}
template <typename T>
node<T> *find(node<T> *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));
}
template <typename T>
int cnt(node<T> *t, T 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);
}
template <typename T>
node<T> *update(node<T> *t, int l, int r, T v) {
	auto t1 = split(t, l);
	auto t2 = split(t1.second, r - l);
	t2.first->lazy = merge2(t2.first->lazy, v);
	return merge(t1.first, merge(t2.first, t2.second));
}
template <typename T>
void print(node<T> *t) {
	if (t == nullptr) return;
	print(t->ch[0]);
	printf(" %d", t->val);
	print(t->ch[1]);
}
template <typename T>
node<T> *shift(node<T> *t, int l, int r) {
	pair<node<T>*, node<T>*> 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)));
}
template <typename T>
void change(node<T> *t, int k, T 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, type, s, t, x;
	cin >> n >> q;
	node<int> *root = nullptr;
	for (int i = 0; i < n; i++) {
		root = insert(root, i, id);
	}
	while (q--) {
		cin >> type;
		if (type == 0) {
			cin >> s >> t >> x;
			root = update(root, s, t + 1, x);
		}
		else {
			cin >> s >> t;
			printf("%d\n", find(root, s, t + 1));
		}
	}
	return 0;
}

Measured memory_bytes: 12016