// AOJ DSL_2_A Range Minimum Query (RMQ)
// 2018.5.5 bal4u

#include <stdio.h>
#include <stdlib.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()
{
	int n = 0, c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

void out(int n)
{
	int i;
	char ob[20];

	if (!n) pc('0');
	else {
//		if (n < 0) pc('-'), n = -n;
		i = 0; while (n) ob[i++] = n%10 + '0', n/=10;
		while (i--) pc(ob[i]);
	}
	pc('\n');
}

#define INF 0x7fffffff

// セグメント木の初期化：配列の確保と初期値による初期化
int *seg; int sz;
void segtree(int n, int init_val)
{
	int i;

	sz = 1; while (sz < n) sz <<= 1;
	n = sz << 1;
	seg = malloc(n << 2);
	for (i = 0; i < n; i++) seg[i] = init_val;
//	memset(seg, init_val, sz << 2);
}

// k番目（0-index）の値を v に変更
void update(int k, int v)
{
	int p;

	k += sz - 1;
	seg[k] = v;
	while (k > 0) {
		k = (k-1) >> 1;
		p = (k << 1)+1;
		v = seg[p+1];
		if (v > seg[p]) v = seg[p];
		seg[k] = v;
	}
}

int query2(int a, int b, int k, int l, int r) 
{
	int m, lmin, rmin;

	if (r <= a || b <= l) return INF;
    if (a <= l && r <= b) return seg[k];
	k <<= 1, m = (l+r) >> 1;
    lmin = query2(a, b, k+1, l, m);
    rmin = query2(a, b, k+2, m, r);
    return (lmin <= rmin)? lmin: rmin; 
}

// 空間 [a, b)　内の最小値
int range_min_query(int a, int b)
{
	return query2(a, b+1, 0, 0, sz);
}


int main()
{
	int n, q, op, x, y;

	n = in(), q = in();
	segtree(n, INF);

	while (q--) {
		op = in(), x = in(), y = in();
		if (op) out(range_min_query(x, y));
		else update(x, y);
	}
	return 0;
}

