/**
	author:  shobonvip
	created: 2025.04.19 23:10:13
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

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

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

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

ll op(ll a, ll b) {
	return min(a, b);
}
ll e() {
	return (ll)1e18;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, q; cin >> n >> q;
	segtree<ll,op,e> seg_left(n);
	segtree<ll,op,e> seg_right(n);

	while(q--) {
		int t; cin >> t;
		if (t == 1) {
			ll x; cin >> x;
			x--;
			ll ans = 1e18;
			chmin(ans, x);

			chmin(ans, seg_left.prod(0, x + 1) + x);
			chmin(ans, seg_right.prod(x, n) - x);
			cout << ans << '\n';
		}else {
			ll x; cin >> x;
			x--;
			ll c; cin >> c;
			seg_left.set(
				x, min(seg_left.get(x), c - x)
			);
			seg_right.set(
				x, min(seg_right.get(x), c + x)
			);
		}
	}


}