#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

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

struct Edge{
    int to;
    int weight;
    Edge(int t, int w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    int weight;
    edge(int f,int t,int w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

bool isPalindrome(string s){
    string t = s;
    reverse(all(t));
    return s==t;
}

constexpr ll LNF = 1e18+7;

constexpr int INF = 1e9+7;

vector<int> dx = {-1,0,1,0};
vector<int> dy = {0,-1,0,1};

/* template */

//一点更新O(√N)・区間所得O(√N)平方分割
template<class T>
struct SqrtDecomposition{
  using F=std::function<T(T,T)>;
  const int sqrtN = 512;
  int n,k;
  T ide_ele;
  std::vector<T> data,bucket;
  F fn;
  
  //初期化
  SqrtDecomposition(int n,T ide_ele,F fn) : n(n), ide_ele(ide_ele) , fn(fn) {
    k = (n+sqrtN-1)/sqrtN;
    data.assign(k*sqrtN,ide_ele);
    bucket.assign(k,ide_ele);
  }

  //data[index]に(T)xに更新
  void add(int index, T x){
    data[index] = x;
    k = index/sqrtN;
    T sum = ide_ele;
    for(int i = k*sqrtN; i<(k+1)*sqrtN; i++){
      sum = fn(sum,data[i]);
    }
    bucket[k] = sum;
  }

  //[l,r)においてクエリ処理
  T query(int l,int r){
    int k_l = l/sqrtN;
    int k_r = r/sqrtN;
    T sum = ide_ele;
    if(k_l==k_r){
      for(int i = l; i<r; i++){
        sum = fn(sum,data[i]);
      }
      return sum;
    }
    for(int i = l; i<(k_l+1)*sqrtN; i++){
      sum = fn(sum,data[i]);
    }
    for(int i = k_r*sqrtN; i<r; i++){
      sum = fn(sum,data[i]);
    }
    for(int i = (k_l+1); i<k_r; i++){
      sum = fn(sum,bucket[i]);
    }
    return sum;
  }
};

const ll ide_ele = (1ll<<31ll)-1ll;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,q; cin >> n >> q;
    SqrtDecomposition<ll> RMQ(n,ide_ele,[](ll a,ll b){ return min(a,b);});
    rep(_,0,q){
      int c; ll x,y; cin >> c >> x >> y;
      if(c==0){
        RMQ.add(x,y);
      }
      else{
        cout << RMQ.query(x,y+1) << endl;
      }
    }
}


Measured memory_bytes: 3684