#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
//using ll = long long;
typedef long long ll;
struct Node{
  int x;
  Node(){
    x = INT_MAX;
  }
  Node(int v){
    x = v;
  }
  
};

template <int NV>
class SegTree
{
  int n;
  vector <Node> seg_tree;
  Node MAXNODE(){
    return Node(INT_MAX);
  }
  Node comp(Node &a, Node &b) {
    if (a.x < b.x) {
      return a;
    }else{
      return b;
    }
  }
 public:
  SegTree(){
    seg_tree.resize(NV * 2, Node());
  }
  void init(int n_){
    n = 1;
    while(n < n_) {
      n *= 2;
    }
  }
  
  inline void update(int k, Node &a) {//k????????????(0-indexed)???a????????´
    k += n - 1;
    seg_tree[k] = a;
    while (k > 0) {
      k = (k - 1) / 2;
      seg_tree[k] = comp(seg_tree[k * 2 + 1], seg_tree[k * 2 + 2]);
    }
  }
  inline Node query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) {
      return MAXNODE();
    }
    if (a <= l && r <= b) {
      return seg_tree[k];
    }
    Node vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
    Node vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
    return comp(vl, vr);
  }
  inline Node query(int a, int b) {
    return query(a, b, 0, 0, n);
  }
};
SegTree <1 << 17> st;

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N;
  int Q;
  cin >> N >> Q;
  st.init(N);
  while(Q--){
    int t,x,y;
    cin >> t >> x >> y;
    if (t == 0) {
      Node z = Node(y);
      st.update(x, z);
    }else{
      Node z = st.query(x, y + 1);
      cout << z.x << endl;
    }
  }
  
  

  return 0;
}

Measured memory_bytes: 2056