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

int id = INT_MAX;
int merge(int l, int r) {
	return min(l, r);
}

struct node {
	int val;
	int all;
	node *ch[2];
	int size;
	int sum;
	node(int v) : val(v), all(v), size(1), sum(v) {
		ch[0] = ch[1] = nullptr;
	}
};

int count(node *t) { return t == nullptr ? 0 : t->size; }
int sum(node *t) { return t == nullptr ? 0 : t->sum; }
int que(node *t) { return t == nullptr ? id : t->all; }
node *update(node *t) {
	t->size = count(t->ch[0]) + count(t->ch[1]) + 1;
	t->sum = sum(t->ch[0]) + sum(t->ch[1]) + t->val;
	t->all = merge(que(t->ch[0]), merge(t->val, que(t->ch[1])));
	return t;
}
node *rotate(node *t, int b) {
	node *s = t->ch[1 - b];
	t->ch[1 - b] = s->ch[b];
	s->ch[b] = t;
	update(t); update(s);
	return s;
}
node *splay(node *t, int k) {
	assert(t != nullptr && k < count(t));
	int c = count(t->ch[0]);
	if (k < c) {
		int cc = count(t->ch[0]->ch[0]);
		if (k < cc) {
			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]->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]->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]->ch[1] = splay(t->ch[1]->ch[1], k - (cc + 1));
			t = rotate(t, 0);
			t = rotate(t, 0);
		}
		else {
			t = rotate(t, 0);
		}
	}
	return t;
}
node *merge(node *l, node *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;
}
pair<node*, node*> split(node *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));
}
node *insert(node *t, int k, int v) {
	pair<node*, node*> s = split(t, k);
	node *r = merge(s.first, new node(v));
	r = merge(r, s.second);
	return r;
}
node *erase(node *t, int k) {
	pair<node*, node*> s1 = split(t, k), s2 = split(s1.second, 1);
	if (s2.first != nullptr) delete s2.first;
	return merge(s1.first, s2.second);
}
int find(node *t, int l, int r) {
	if (t == nullptr) return id;
	if (r < 0 || l >= count(t)) return id;
	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))));
}
node *find(node *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));
}
int cnt(node *t, int 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);
}

int main()
{
	cin.sync_with_stdio(false);
	cin.tie(0);
	int n, q, com, x, y;
	cin >> n >> q;
	node *root = nullptr;
	for (int i = 0; i < n; i++) {
		root = insert(root, i, id);
	}
	while (q--) {
		cin >> com >> x >> y;
		if (com) {
			printf("%d\n", find(root, x, y + 1));
		}
		else {
			root = erase(root, x);
			root = insert(root, x, y);
		}
	}
	return 0;
}

Measured memory_bytes: 12060