INF = 2**60

class FenwickMin:
    def __init__(self, n):
        self.n = n
        self.t = [INF] * (n + 1)
    def update(self, i, v):
        while i <= self.n:
            if v < self.t[i]:
                self.t[i] = v
            else:
                pass
            i += i & -i
    def query(self, i):
        res = INF
        while i > 0:
            if self.t[i] < res:
                res = self.t[i]
            i -= i & -i
        return res

N, Q = map(int, input().split())
ft_left  = FenwickMin(N)
ft_right = FenwickMin(N)

out = []
for _ in range(Q):
    q = input().split()
    if q[0] == '1':
        x = int(q[1])
        ans = x - 1

        m1 = ft_left.query(x)
        if m1 < INF:
            ans = min(ans, m1 + x)

        j = N - x + 1
        m2 = ft_right.query(j)
        if m2 < INF:
            ans = min(ans, m2 - x)

        out.append(str(ans))

    else:
        x, c = int(q[1]), int(q[2])
        ft_left.update(x, c - x)
        j = N - x + 1
        ft_right.update(j, c + x)

print(*out, sep="\n")