#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = (1LL<<60);

struct SegTree {
    int n;
    vector<ll> seg;
    SegTree(int _n): n(1) {
        while (n < _n) n <<= 1;
        seg.assign(2*n, INF);
    }
    void set_val(int k, ll x) {
        k += n;
        seg[k] = min(seg[k], x);
        while (k > 1) {
            k >>= 1;
            seg[k] = min(seg[2*k], seg[2*k+1]);
        }
    }
    ll query(int a, int b) {
        ll res = INF;
        for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
            if (a & 1) res = min(res, seg[a++]);
            if (b & 1) res = min(res, seg[--b]);
        }
        return res;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    cin >> N >> Q;

    SegTree st1(N+1), st2(N+1);

    for(int qi = 0; qi < Q; qi++){
        int type;
        cin >> type;
        if(type == 1){
            int x;
            cin >> x;
            ll ans = x - 1;
            ll m1 = st1.query(1, x+1); 
            if(m1 < INF) ans = min(ans, m1 + x);
            ll m2 = st2.query(x, N+1); 
            if(m2 < INF) ans = min(ans, m2 - x);
            cout << ans << "\n";
        }
        else {
            int x; ll c;
            cin >> x >> c;
            st1.set_val(x, c - x);
            st2.set_val(x, c + x);
        }
    }

    return 0;
}