from collections import deque


class ConvexHullTrick:
    def __init__(self):
        self.deq = deque()
        self.bt = 0
        self.linf = -1 << 30
        self.rinf = 1 << 30

    def check(self, f1, f2):
        return self.f(f1, self.bt) <= self.f(f2, self.bt) and self.f(
            f1, self.rinf
        ) <= self.f(f2, self.rinf)

    def f(self, _f, x):
        return _f[0] * x * x + _f[1] * x + _f[2]

    def add_line(self, a, b, c):
        f = (a, b, c)
        while len(self.deq) >= 2 and self.check(self.deq[-1], f):
            self.deq.pop()
        self.deq.append(f)

    def get(self, x):
        while len(self.deq) >= 2 and self.f(self.deq[0], x) <= self.f(self.deq[1], x):
            self.deq.popleft()
        bt = x
        return self.f(self.deq[0], x)


a = int(input())
cht = ConvexHullTrick()
cht.add_line(-a, 0, 0)
for _ in range(int(input())):
    query = list(map(int, input().split()))
    if query[0] == 1:
        s, t = query[1:]
        b = a * (t + s)
        c = a * t * t - b * t
        cht.add_line(-a, b, c)
    else:
        print(max(0, cht.get(query[1])))