#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
constexpr int INF = 1001001001;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  segtree<int, [](int x, int y) { return min(x, y); }, []() { return INF; }> seg1(n), seg2(n);
  // y=x
  seg1.set(0, 0);
  // y=-x
  seg2.set(0, 0);
  rep(_, q) {
    int type;
    cin >> type;
    if (type == 1) {
      int x;
      cin >> x;
      x--;
      int ans = INF;
      chmin(ans, x + seg1.prod(0, x + 1));
      chmin(ans, -x + seg2.prod(x, n));
      cout << ans << '\n';
    } else {
      int x, c;
      cin >> x >> c;
      x--;
      seg1.set(x, min(seg1.get(x), c - x));
      seg2.set(x, min(seg2.get(x), c + x));
    }
  }
}