#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
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...));
}

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< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

struct QuerySqrtDecomposition {
  vector< int > use, idx, rev;

  QuerySqrtDecomposition(int N) : use(N + 1), rev(N + 1, -1) {}

  void add(int l, int r) { // [l, r)
    use[l] = true;
    use[r] = true;
  }

  void add(int k) {
    add(k, k + 1);
  }

  void build() {
    for(int i = 0; i < use.size(); i++) {
      if(use[i]) idx.emplace_back(i);
    }
    for(int i = 0; i + 1 < idx.size(); i++) {
      for(int j = idx[i]; j < idx[i + 1]; j++) {
        rev[j] = i;
      }
    }
    rev[idx.back()] = (int) idx.size() - 1;
  }

  inline int size() const { return (int) idx.size() - 1; }

  inline int l(int k) const { return idx[k]; }

  inline int r(int k) const { return idx[k + 1]; }

  inline int operator[](int k) const { return rev[k]; }
};


int main() {
  int N, Q;
  cin >> N >> Q;
  vector< int > A(N, INT_MAX);

  struct Query {
    int type, x, y;
  };
  vector< Query > qs;
  const int B = 800;

  while(Q--) {
    int c, x, y;
    cin >> c >> x >> y;
    if(c == 1) ++y;

    qs.emplace_back((Query) {c, x, y});
    if(qs.size() == B || Q == 0) {

      QuerySqrtDecomposition qsd(N);
      for(auto &q : qs) {
        if(q.type == 0) qsd.add(q.x);
        else qsd.add(q.x, q.y);
      }
      qsd.build();

      vector< int > val(qsd.size(), INT_MAX);
      for(int i = 0; i < qsd.size(); i++) {
        for(int j = qsd.l(i); j < qsd.r(i); j++) {
          chmin(val[i], A[j]);
        }
      }

      vector< int > rep(qsd.size()), need(qsd.size());

      for(auto &q : qs) {
        if(q.type == 0) {
          rep[qsd[q.x]] = q.y;
          need[qsd[q.x]] = true;
        } else {
          int ret = INT_MAX;
          for(int j = qsd[q.x]; j < qsd[q.y]; j++) {
            if(need[j]) chmin(ret, rep[j]);
            else chmin(ret, val[j]);
          }
          cout << ret << "\n";
        }
      }


      for(int i = 0; i < qsd.size(); i++) {
        if(need[i]) {
          for(int j = qsd.l(i); j < qsd.r(i); j++) {
            A[j] = rep[i];
          }
        }
      }
      qs.clear();

    }
  }

}







Measured memory_bytes: 4200