#pragma GCC optimize("O2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define whlie while
#define retunr return
#define reutrn return
#define reutnr return
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define inf 1001001001
#define infLL (1LL << 61)
#define FOR(i,a,b) for(int (i)=(int)(a); (i)<(int)(b); (i)++) // [a,b)
#define rep(i,N) FOR((i), 0, (int)(N)) // [0,N)
#define FORR(i,a,b) for(int (i)=(int)(b) - 1; (i)>=(int)(a); (i)--)
#define repr(i,N) FORR((i), 0, (int)(N))
#define each(x,v) for(auto &x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it=v.begin();it!=v.end();it++)
#define vrepr(v,it) for(auto it=v.rbegin();it!=v.rend();it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define ind(...) double __VA_ARGS__; in(__VA_ARGS__)
#define inpii(...) pii __VA_ARGS__; in(__VA_ARGS__)
//#define rand mtrand
//#define randinit random_device seed_gen; mt19937 mtrand(seed_gen()+2)

#ifdef LOCAL  
  #define trc(...) do { cout << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define stopif(val) assert( !(val) )
  #define trcv(v,...) do { cout << #v << " = "; vector_debug(v , ##__VA_ARGS__);cout << endl;} while(0)
#else
  #define trc(...)
  #define stopif(...)
  #define trcv(...)
#endif

using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector< vector<int> >;

struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(15);} } iosetupnya;
/* 
int gcd(int a, int b){if(a>b) swap(a,b); return a==0 ? b : gcd(b%a,a);} ll gcd(ll a, ll b){if(a>b) swap(a,b); return a==0 ? b : gcd(b%a,a);}
ll lcm(int a, int b){return (1LL * a / gcd(a,b)) * b;} ll lcm(ll a, ll b){return (a / gcd(a,b)) * b;}
*/
inline ll pow(int a, int b){ll ans = 1; rep(i,b) ans *= a; return ans;} inline ll pow(ll a, ll b){ll ans = 1; rep(i,b) ans*= a; return ans;}
inline ll pow(int a, ll b){ll ans = 1; rep(i,b) ans *= a; return ans;} inline ll pow(ll a, int b){ll ans = 1; rep(i,b) ans*= a; return ans;}
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename C> inline void _cin(C &c){cin >> c;}
template<typename T,typename U> inline void _cin(pair<T,U> &p){cin >> p.fi; cin >> p.se;}
template<typename C> inline void _cout(const C &c){cout << c;}
template<typename T,typename U> inline void _cout(const pair<T,U> &p){cout << p.fi << ' ' << p.se;}
void in(){} template <typename T,class... U> void in(T &t,U &...u){ _cin(t); in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,U ...u){ _cout(t); if(sizeof...(u)) cout << ' '; out(u...);}
template<typename C> inline void in(vector<C> &v,int N=-1){if(sz(v) != 0){int M=(N == -1) ? sz(v) : N; rep(i,M) _cin(v[i]);}else{C c;rep(i,N) v.pb((_cin(c),c));}}
template<typename C> inline void in(C v[],int N){rep(i,N) _cin(v[i]);}
template<typename C> inline void out(const vector<C> &v,int N=-1){int M=(N == -1) ? sz(v) : N; rep(i,M) {cout<<( (i)?" ":"" ); _cout(v[i]);} cout<<"\n";}
template<typename C> inline void out(C v[],int N){rep(i,N) {cout<<( (i)?" ":"" ); _cout(v[i]);} cout<<"\n";}
template<typename C> inline void vector_debug(const vector<C> &v,int N=-1){cout << "{"; int M=(N == -1) ? sz(v) : N; rep(i,M) {cout<<( (i)?", ":"" ); _cout(v[i]);} cout<<"}";}
template<typename C> inline void vector_debug(C v[], int N){cout << "{"; rep(i,N) {cout<<((i)?", ":""); _cout(*(v+i));} cout<<"}";}
void dbg_out(){cout << endl;} template <typename T,class... U> void dbg_out(const T &t,U ...u){ _cout(t); if(sizeof...(u)) cout << ", "; dbg_out(u...);}
template<typename C,class... U> void dbg_out(const vector<C> &v,U ...u){vector_debug(v); if(sizeof...(u)) cout << ", "; dbg_out(u...);}
template<typename C,class... U> void dbg_out(const vector<vector<C>> &v,U ...u){cout << "{ "; rep(i,sz(v)) {if(i)cout<<", "; vector_debug(v[i]);} cout << " }"; if(sizeof...(u)) cout << ", "; dbg_out(u...);}
template<typename C> inline C vmax(const vector<C> &v){C n=v[0]; rep(i,sz(v)) amax(n,v[i]); return n;} template<typename C> inline C vmax(C v[], int N){C n=v[0]; rep( i , N ) amax(n,v[i]); return n;}
template<typename C> inline C vmin(const vector<C> &v){C n=v[0]; rep(i,sz(v)) amin(n,v[i]); return n;} template<typename C> inline C vmin(C v[], int N){C n=v[0]; rep( i , N ) amin(n,v[i]); return n;}
void die(string s){out(s); exit(0);}

////////////
/// main ///
////////////

// セグ木
template<typename T,typename F,T UNIT>
struct ST{
  int size;
  vector<T> seg;
  F func;
  vector<int> seg_sz;

  ST(const vector<T> &v,F func) : func(func){
    // initialize
    seg.resize( ( size = v.size() ) << 1 , UNIT);
    // set
    // n A[n]まで見た
    int n = 0; seg_sz.pb(0);
    while(n < size){
      // これからm個の配列を埋める
      int m = 1 << (31 - __builtin_clz(size ^ n) );
      for(int i = n; i < n + m; i++){
        //trc(n , m , i);
        seg[n + m + i] = v[i];
      }
      seg_sz.pb( (n += m) );
    }
    //
    build();
  }

  void build(){
    vector<int>::const_iterator it = seg_sz.begin();
    while(1){
      int l = *(it++);
      if(it == seg_sz.end()) return;
      int r = *it;
      const int dif = l << 1; // k 添え字のズレ
      for( int i = r - l - 1; i > 0; i-- ){
        seg[dif | i] = func(seg[dif | (i << 1)] , seg[dif | (i << 1) | 1]);
      }
    }    
  }
  
  void update(int k, T& x){
    vector<int>::const_iterator it = upper_bound(seg_sz.begin() , seg_sz.end() , k);
    seg[ (k += *it) ] = x; 
    it--; k -= (*it) << 1; const int dif = (*it) << 1;
    //trc(k , dif);
    // [*it , *(it + 1) ) 間のセグ木を更新 添え字はdifずれている
    while(k >>= 1){
      seg[dif | k] = func(seg[dif | (k << 1)] , seg[dif | (k << 1) | 1]);
    }
  }
  // [a,b)へのクエリ
  T query(int a, int b){
    //trc("query" , a , b);
    if(a < 0){a = 0;} b--; // いったん閉区間にする
    
    // おなじセグ木に乗せる処理
    T ret = UNIT;
    vector<int>::const_iterator itl = upper_bound(seg_sz.begin() , seg_sz.end() , a),
      itr = upper_bound(seg_sz.begin() , seg_sz.end() , b);
    itl--; const int cur_sz = *(itr--) - *itr;// 右側の載っているセグ木のサイズ
    //trc(ret , *itl , *itr);
    while(itl != itr) {
      if(a == *itl) ret = func(ret , seg[ ( (*itl++) << 1 ) | 1 ]);
      else ret = func(ret , query(a , (*(++itl))) );
      a = *itl;
      //trc(ret , *itl , *itr);
    }
    const int dif = (*itr) << 1;
    // 普通のセグ木の処理 セグ木のサイズはcur_sz a,bは添え字はdifずれる
    T L = UNIT, R = UNIT;
    for( a += cur_sz - *itr , b += cur_sz + 1 - *itr ; a<b; a>>=1,b>>=1){
      if(a & 1) L = func(L,seg[dif | (a++)]);
      if(b & 1) R = func(seg[dif | (--b)],R);
    }
    return func(ret , func(L, R) );
  }

  T operator[](const int &k) const{
    vector<int>::const_iterator it = upper_bound(seg_sz.begin() , seg_sz.end() , k);
    return seg[ *it + k ];
  }

};

constexpr int N = 1000000;

int main(){
  ini(N,Q);
  vl v(N,(1LL<<31)-1 );
  auto f = [](ll a,ll b){return min(a,b);};
  ST<ll , decltype(f) ,(1LL<<31)-1 > st(v , f);
  /**
  trc(st.seg);
  trc(st.seg_sz);
  trc(st.seg);
  trc(st.seg_sz);
  //*/
  rep(hoge,Q){
    ini(c);
    if(c){
      ini(i,j);
      out(st.query(i,j+1));
    }
    else{
      ini(i); inl(j);
      st.update(i , j);
    }
  }
}


Measured memory_bytes: 5168