// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
#include <unordered_map>
//#include <complex>
//#include <deque>
#include <valarray>

// stream
//#include <istream>
#include <sstream>
//#include <ostream>
//#include <fstream>

// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

//namespace std {
//	template < typename T > std::string to_string(const T& n) {
//		std::ostringstream stm;
//		stm << n;
//		return stm.str();
//	}
//	int stoi(std::string s, int tmp = 10) {
//		std::istringstream stm(s);
//		int res;
//		stm >> res;
//		return res;
//	}
//}

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;

// output
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}

// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

// test
template<class T> std::vector<std::vector<T>> VV(int n) {
	return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
	return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const

//#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

// Description: セグメント木を用いて区間内の最大値/最小値/合計を計算する。O(logN)。

// ------------>8------------ SegmentTree ------------>8------------

// -- Query Type enum.
enum QUERY_GET { SUM, MAX, MIN };
template <class T = int>
class SegmentTree {
private:
	int ARY_SIZE;
	T initVal;
	std::vector<T> ary;
	std::function<T(T&, T&)> merge;

	void init(int n, QUERY_GET qtype) {
		switch (qtype) {
		case SUM:
			initVal = 0;
			merge = [](T& l, T& r) {return l + r; };
			break;
		case MAX:
			initVal = std::numeric_limits<T>::lowest();
			merge = [](T& l, T& r) {return (l > r) ? l : r; };
			break;
		case MIN:
			initVal = std::numeric_limits<T>::max();
			merge = [](T& l, T& r) {return (l < r) ? l : r; };
			break;
		default: struct INVALID_QUERY_TYPE_ERROR {}; throw INVALID_QUERY_TYPE_ERROR(); break;
		}
		init(n);
	}
	void init(int n) {
		while (ARY_SIZE < n) ARY_SIZE <<= 1;
		ary.resize(ARY_SIZE << 1, initVal);
	}
public:
	SegmentTree(int n, QUERY_GET qtype) : ARY_SIZE(1) { init(n, qtype); }
	SegmentTree(int n, T initVal, std::function<T(T&, T&)> f) : ARY_SIZE(1), initVal(initVal), merge(f) { init(n); }

	// -- a[i] = val;
	inline void update(int i, T val) {
		i += ARY_SIZE;
		ary[i] = val;
		while (i > 1) {
			i >>= 1;
			ary[i] = merge(ary[i << 1], ary[(i << 1) + 1]);
		}
	}
	// -- a[i] += val;
	inline void add(int i, T val) {
		update(i, ary[i + ARY_SIZE] + val);
	}
	// -- [l, r)
	inline T query(int l, int r) {
		if (l >= r) return initVal;
		T vl = initVal, vr = initVal;
		for (l += ARY_SIZE, r += ARY_SIZE; l != r; l >>= 1, r >>= 1) {
			if (l & 1) vl = merge(vl, ary[l++]);
			if (r & 1) vr = merge(ary[--r], vr);
		}
		return merge(vl, vr);
	}
	T operator[](int i) { return ary[i + ARY_SIZE]; }

	void debugShow() {
		for (int i = ARY_SIZE; i < ARY_SIZE << 1; ++i) std::cerr << ary[i] << " ";
		std::cerr << "\n";
	}
};
using ST = SegmentTree<int>;
// ------------8<------------ SegmentTree ------------8<------------


signed main() {

	VAR(int, n, q);
	VEC_ROW(int, q, com, x, y);

	ST st(n, MIN);
	REP(i, q) {
		if (com[i] == 0) st.update(x[i], y[i]);
		if (com[i] == 1) {OUT(st.query(x[i], y[i] + 1))BR; }
	}

	return 0;
}


Measured memory_bytes: 4944