//#include <windows.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//#define int ll
typedef vector<vector<pair<int, int> > > vvp;
typedef vector<pair<int, int> > vp;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<vector<ll> > vvl;
typedef vector<ll> vl;
typedef vector<vector<double> > vvd;
typedef vector<double> vd;
typedef vector<vector<bool> > vvb;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef pair<string, int> psi;
typedef pair<int, int> pii;
//#define unix ((unsigned int)time(NULL))
#define sort_(x) sort(x.begin(),x.end())
#define rep(i,s,n) for(int i = (s); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define yn(f) (f?"yes":"no")
#define YN(f) (f?"YES":"NO")
#define Yn(f) (f?"Yes":"No")
#define len(x) int(x.size())
#define inf (1000000007)
#define ll_inf (1000000000000000007)
#define nil -1

void puts() {
	cout << endl;
}
/*
template <class Head, class... Tail>
void puts(Head&& head, Tail&& ... tail) {
	cout << head;
	if (sizeof...(tail) == 0) {
		cout << endl;
	}
	else {
		cout << " ";
		puts(forward<Tail>(tail)...);
	}

}
*/
void puts(vector<pair<int,int> >& A) {
	for (int i = 0; i < A.size(); i++)
	{
		cout <<"("<< A[i].first<<","<<A[i].second<<")";
		if (A.size() - 1 == i) {
			cout << endl;
		}
		else {
			cout << " ";
		}
	}
}
void puts(vector<vector<pair<int,int> > >& A) {
	for (int i = 0; i < A.size(); i++)
	{
		puts(A[i]);
	}
}
template <class T>
void puts(vector<T>& A) {
	for (int i = 0; i < A.size(); i++)
	{
		cout << A[i];
		if (A.size() - 1 == i) {
			cout << endl;
		}
		else {
			cout << " ";
		}
	}
}
template<class T>
void puts(vector<vector<T> >& A) {
	for (int i = 0; i < A.size(); i++)
	{
		puts(A[i]);
	}
}
class disjoint_set {
public:
	vi p, rank;
	disjoint_set(int size) {
		p.resize(size, 0);
		rank.resize(size, 0);
		for (int i = 0; i < size; i++)makeSet(i);
	}
	void makeSet(int x) {
		p[x] = x;
		rank[x] = 0;
	}
	bool same(int x, int y) {
		return findSet(x) == findSet(y);
	}
	void unite(int x, int y) {
		link(findSet(x), findSet(y));
	}
	void link(int x, int y) {
		if (rank[x] < rank[y]) {
			p[x] = y;
		}
		else {
			p[y] = x;
			if (rank[x] == rank[y]) {
				rank[x]++;
			}
		}
	}
	int findSet(int x) {
		if (x != p[x]) {
			p[x] = findSet(p[x]);
		}
		return p[x];
	}
};
class rmq {
public:
	int n,max_n,inf_;
	vi A;
	rmq(int n_) {
		max_n = (1<<17);
		n = 1;
		inf_ = 2147483647;
		A.resize(max_n*2-1);
		while (n < n_)n *= 2;
		for (int i = 0; i < n*2-1; i++)A[i] = inf_;
	}
	void update(int i,int x) {
		i += n - 1;
		A[i] = x;
		while (i>0) {
			i = (i - 1) / 2;
			A[i] = min(A[i*2+1],A[i*2+2]);
		}
	}
	int query(int left,int right) {
		int i = 0;
		int left2 = 0;
		int right2 = n;
		return query(left, right, i, left2, right2);
	}
	int query(int left,int right,int i,int left2,int right2) {
		if (right2 <= left || right <= left2) {
			return inf_;
		}
		if (left <= left2 && right2 <= right) {
			return A[i];
		}
		else {
			int mid = (left2 + right2) / 2;
			return min(query(left, right, i * 2 + 1, left2, mid), query(left, right, i * 2 + 2, mid, right2));
		}
	}
};
void dedupe(vi& A) {
	sort(A.begin(),A.end());
	A.erase(unique(A.begin(),A.end()),A.end());
}
int gcd(int a, int b) {//log N
	return (b == 0) ? a : gcd(b, a % b);
}
ll gcd(ll a, ll b) {//log N
	return (b == 0) ? a : gcd(b, a % b);
}
int lcm(int a, int b) {//log N
	return (a * b) / gcd(a, b);
}
ll lcm(ll a, ll b) {//log N
	return (a * b) / gcd(a, b);
}
int extgcd(int a, int b, int& x, int& y) {// log N
	int d = a;
	if (b == 0) {
		x = 1;
		y = 0;
	}
	else {
		d = extgcd(b, a % b, y, x);
		y -= (a / b) * x;
	}
	return d;
}
vi get_primes(int limit) {//N log N
	vb A(limit + 1, true);
	for (int i = 2; i < A.size(); i++) {
		if (!A[i])continue;
		for (int j = i * 2; j < A.size(); j += i)A[j] = false;
	}
	vi B;
	for (int i = 2; i < A.size(); i++)
	{
		if (A[i])B.push_back(i);
	}
	return B;
}
bool is_prime(int num) {// sqrt(N)
	if (num < 2)return false;
	for (int i = 2; i <= sqrt(num); i++)
	{
		if (num % i == 0) {
			return false;
		}
	}
	return true;
}
ll merge_count(vi & A) {//N log N
	int n = A.size();
	if (n <= 1)return 0;
	long long count = 0;
	int mid = n / 2;
	vector<int> B(A.begin(), A.begin() + mid);
	vector<int> C(A.begin() + mid, A.end());
	count += merge_count(B);
	count += merge_count(C);
	B.push_back(inf);
	C.push_back(inf);
	int B_i = 0;
	int C_i = 0;
	for (int i = 0; i < n; i++) {
		if (B[B_i] <= C[C_i]) {
			A[i] = B[B_i++];
		}
		else {
			count += (n / 2) - B_i;
			A[i] = C[C_i++];
		}
	}
	return count;
}
vi bit(int size,int num) {
	vi A;
	for (int j = 0; j < size; j++)
	{
		if ((num & (1 << (size - j - 1))) > 0) {
			A.push_back(1);
		}
		else {
			A.push_back(0);
		}
	}
	return A;
}
vvi bit_z(int size) {//2**N
	vvi A;
	for (int i = 0; i < (1<<size); i++)
	{
		vi temp = bit(size,i);
		A.push_back(temp);
	}
	return A;
}
vvi bit_z(int size, int n) {
	vvi A;
	int s = (1<<n)-1;
	A.push_back(bit(size,s));
	while (true) {
		int x = s & (-s);
		int y = s + x;
		int z = s & (~y);
		
		z /= x;
		z = z >> 1;
		s = (y | z);
		if (s >= (1 << size))break;
		A.push_back(bit(size,s));
	}
	return A;
}
vvi bit_z(int size,int min,int max) {
	vvi A;
	for (int i = min; i <=max; i++)
	{
		vvi B = bit_z(size,i);
		A.insert(A.end(),B.begin(),B.end());
	}
	return A;
}
int random(int min,int max) {
	int r = rand() % (max+1-min)+min;
	return r;
}
/*
vector< pair < ll, int > > factorize(ll n) {
	ll count = 0;
	vector< pair< ll , int > > res;
	for (ll i  = 2; i*i <= n; i++)
	{
		if (n % i )continue;
		res.emplace_back(i,0);
		while (n%i==0) {
			n /= i;
			res.back().second++;
		}
	}
	if (n != 1)res.emplace_back(n,1);
	return res;
}
*/

signed main() {
	int n; cin >> n;
	int q; cin >> q;
	rmq S = rmq(n);
	rep(i, 0, q) {
		int o; cin >> o;
		int a, b; cin >> a >> b;
		if (o == 0) {
			S.update(a, b);
		}
		else {
			cout<<(S.query(a,b+1))<<endl;
		}
	}
	
}




Measured memory_bytes: 3916