#include using namespace atcoder; #include template inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}} template inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}} #define ll long long #define double long double #define rep(i,n) for(int i=0;i<(n);i++) #define REP(i,n) for(int i=1;i<=(n);i++) #define mod (ll)(1e9+7) #define inf (ll)(3e18+7) #define eps (double)(1e-9) #define pi (double) acos(-1) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() using namespace std; using S = int; S op(S a, S b) { return min(a, b); } S e() { return 2*mod; } int main() { int n, q; cin >> n >> q; segtree seg1(n), seg2(n); rep(i, q) { int t; cin >> t; if(t == 1) { int x; cin >> x; x--; int ans = x; chmin(ans, seg1.prod(0, x) + x); chmin(ans, seg2.prod(x, n) - x); cout << ans << endl; } else { int x, c; cin >> x >> c; x--; seg1.set(x, c-x); seg2.set(x, c+x); } } }