Your task is to efficiently process the following types of queries:
Add a lineax+bFind the maximum point in any line at positionx
The first line has an integer $n$ : the number of queries.
The following $n$ lines describe the queries. The format of each line is either "1 $a$ $b$ " or "2 $x$ ".
You may assume that the first query is of type 1.
Print the answer for each query of type 2.
6 1 1 2 2 1 2 3 1 0 4 2 1 2 3\n · · \n · \n · \n · · \n · \n · \n
3 5 4 5\n \n \n \n