#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf = (1LL << 31) - 1;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

const int N = 1 << 17; // ~~ 1.3 * 10^5
/**
 * 0-indexed, [l, r)
 * update(l,r,v) := [l,r)?????????????????????v???????§?????¶????
 * query (l,r)   := [l,r)????????????????°????????±???????
 **/

struct Node {
    ll val;  // ??´??°????????????. ?????????????????§??????????????????????????¨????????????????????????????????????.
    ll lazy; // ?????¶??????????????????
    Node(){
        val  = inf;
        lazy = 0;
    }
};

Node seg[2 * N];

// ?????????k?????????????????????????????????
// a, b: ?????????k?????¨?????????[a, b)
inline void lazy_evaluate_node(int k){
    seg[k].val += seg[k].lazy;

    // ?????§???????????°??????
    if(k < N - 1){
        seg[2 * k + 1].lazy += seg[k].lazy;
        seg[2 * k + 2].lazy += seg[k].lazy;
    }

    seg[k].lazy = 0;
}

// ?????????k???????????´??°
// (k??????????????§????????????????????????(lazy???0)) and (k????????§??????) ?????????
inline void update_node(int k){
    seg[k].val = min(seg[2 * k + 1].val, seg[2 * k + 2].val);
}

// update(l, r, v) := [l, r)?????´??°??????
void update(int l, int r, ll v, int k = 0, int a = 0, int b = N - 1){
    lazy_evaluate_node(k);

    if(b <= l or r <= a) return;

    if(l <= a and b <= r){
        seg[k].lazy += v;
        lazy_evaluate_node(k);
        return;
    }

    int m = (a + b) / 2;
    update(l, r, v, 2 * k + 1, a, m);
    update(l, r, v, 2 * k + 2, m, b);
    update_node(k);
}

// query(l, r) := [l, r)?????????????????¨?????????????????????
ll query(int l, int r, int k = 0, int a = 0, int b = N - 1){
    lazy_evaluate_node(k);

    if(b <= l or r <= a) return inf;

    if(l <= a and b <= r){
        return seg[k].val;
    }

    int m = (a + b) / 2;
    ll vl = query(l, r, 2 * k + 1, a, m);
    ll vr = query(l, r, 2 * k + 2, m, b);
    update_node(k);

    return min(vl, vr);
}

int main(void){
    int n, Q; cin >> n >> Q;
    rep(loop, Q){
        int com; cin >> com;
        if(com == 0){
            int i, x; cin >> i >> x;
            update(i, i + 1, -query(i, i + 1));
            update(i, i + 1, x);
        }
        else {
            int l, r; cin >> l >> r;
            cout << query(l, r + 1) << endl;
        }
    }

    return 0;
}

Measured memory_bytes: 7248