from sys import stdin
input=lambda :stdin.readline()[:-1]

from heapq import heappop, heappush
hq=[]

def calc(L,R,t):
  #print(L,R,t,-a*(L-t)*(R-t))
  return -a*(L-t)*(R-t)

a=int(input())
q=int(input())
for _ in range(q):
  query=list(map(int,input().split()))
  if query[0]==1:
    s,t=query[1:]
    heappush(hq,(s,t))
  else:
    t=query[1]
    while len(hq)>=2:
      s1,t1=heappop(hq)
      s2,t2=heappop(hq)      
      if calc(s1,t1,t)>calc(s2,t2,t) or t<=s1:
        heappush(hq,(s1,t1))
        heappush(hq,(s2,t2))
        break
      else:
        heappush(hq,(s2,t2))

    ans=0
    if hq:
      s0,t0=hq[0]
      ans=max(ans,calc(s0,t0,t))
    print(ans)
    #print(hq,t)