class SegmentTree:
    # 初期化処理
    # f : SegmentTreeにのせるモノイド
    # default : fに対する単位元
    def __init__(self, size, f=lambda x,y : max(x, y), default=-10**9):
        self.size = 2**(size-1).bit_length()
        self.default = default
        self.dat = [default]*(self.size*2)
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1
            l >>= 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            r >>= 1
        res = self.f(lres, rres)
        return res

n, q = map(int, input().split())
seg = SegmentTree(n)
seg.update(0, 0)
seg2 = SegmentTree(n)
for _ in range(q):
    t, *u = map(int, input().split())
    if t == 1:
        x = u[0]
        x -= 1
        print(min(x - seg.query(0, x + 1), n - 1 - x - seg2.query(x, n)))
    else:
        x, c = u
        x -= 1
        seg.update(x, max(x - c, seg.query(x, x + 1)))
        seg2.update(x, max(n - 1 - x - c, seg2.query(x, x + 1)))