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

//typedef
//------------------------------------------
typedef int64_t LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;

//container util
//------------------------------------------
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define rwhole(f,x,...) ([&](decltype((x)) whole) { return (f)(rbegin(whole), rend(whole), ## __VA_ARGS__); })(x)
#define EACH(i,c) for(decltype((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) whole(sort, c)
#define RSORT(c) rwhole(sort, c)

//constant
//--------------------------------------------
constexpr double EPS = 1e-10;
constexpr double PI  = M_PI;
constexpr int MOD = 1000000007;

// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};

//debug
//--------------------------------------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

//IO accelerate
//--------------------------------------------
struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

//template
//--------------------------------------------
template<typename T>
istream& operator >>(istream& is, vector<T>& vec) {
  for(T& x: vec) is >> x;
  return is;
}
template<typename T>
ostream& operator <<(ostream& os, const vector<T>& vec) {
  for(int i=0; i<vec.size(); i++){
    os << vec[i] << ( i+1 == vec.size() ? "" : "\t" );
  }
  return os;
}
template<typename T>
ostream& operator <<(ostream& s, const vector<vector<T>>& vv) {
	for (int i = 0; i < vv.size(); ++i) {
		s << vv[i] << endl;
	}
	return s;
}

// 多重vector
// auto dp=make_v<int>(4,h,w) みたいに使える
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// 多重vectorのためのfill
// fill_v(dp,0) みたいに使える
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}

template<class T,class U> void chmax(T&a,U b){if(a<b)a=b;}
template<class T,class U> void chmin(T&a,U b){if(b<a)a=b;}
LL gcd(LL a, LL b) { return b?gcd(b,a%b):a;}
LL lcm(LL a, LL b) { return a/gcd(a,b)*b;}

//main code

class SegTree {
private:
	LL n;
	VL node;
public:
	SegTree(const VL& v)
	{
		LL sz = v.size();
		n = 1;while(n < sz) n *= 2; // 最低限必要な最下段のノード数(2のべき乗)
		node.resize(2*n-1, INT64_MAX);
		for (int i = 0; i < sz; i++) {
			node[n+i-1] = v[i];
		}
		for (int i = n-2; i >= 0; i--) {
			node[i] = min(node[i*2+1], node[i*2+2]);
		}
	};

	void update(LL pos, LL val)
	{
		LL k = n+pos-1;
		node[k] = val;
		while (k > 0) {
			k = (k-1)/2;
			node[k] = min(node[2*k+1], node[2*k+2]);
		}
	}

	// [a,b)区間内の要素の最小値を答える
	// [l,r)が対象区間, kが今いるノード
	LL getmin(LL a, LL b, LL k=0, LL l=0, LL r=-1)
	{
		if (r == -1) r = n;
		LL ret = INT64_MAX;
		if (r <= a or l >= b) return ret;
		if (l >= a and r <= b) return node[k];

		//対象区間の一部が要求区間である
		LL vl = getmin(a, b, k*2+1, l, (l+r)/2);
		LL vr = getmin(a, b, k*2+2, (l+r)/2, r);
		return min(vl, vr);
	}
};

int main(int argc, char *argv[])
{
	LL n,q;
	cin >> n >> q;
	VL a(n,INT32_MAX);
	SegTree st(a);
	for (int i = 0; i < q; i++) {
		int c,x,y;
		cin >> c >> x >> y;
		if (c) {
			cout << st.getmin(x,y+1) << endl;
		} else {
			st.update(x,y);
		}
	}
	return 0;
}



Measured memory_bytes: 5708