The first line of input contains N (1 <= N <= 100,000) and Q (1 <= Q <= 100,000) separated by a space.
These give the number of cows initially in the herd and the number of queries, respectively.
The following N lines describe the initial state of the herd. Each line will contain two space separated
integers x and y giving the position of a cow.
The remaining Q lines contain queries either adding a new cow to the herd or testing a fence for usability.
A line of the form "1 x y" means that a new cow has been added to the herd at position (x, y). A line of
the form "2 A B C" indicates that FJ would like to test a fence described by the line Ax + By = C.
All cow positions will be unique over the whole data set and will satisfy (-10^9 <= x, y <= 10^9).
Additionally the fence queries will satisfy -10^9 <= A, B <= 10^9 and -10^18 <= C <= 10^18. No fence
query will have A = B = 0.
第一行包含两个用空格隔开的整数N和Q代表最开始奶牛的数目和FJ的提问的个数。
接下来的N行每行包含两个整数x和y,代表每只奶牛的坐标
最后的Q行,每行代表一个提问,形如“1 x y”的提问代表FJ在坐标为(x,y)的位置放置了一头新的奶牛。形如"2 A B C"的
提问代表FJ向你询问位于直线Ax+By+C上的栅栏是否是有用的。
输入数据保证所有奶牛的坐标都是互不相同的,而且不会出现A=B=0的询问
1<=N<=100000
1<=Q<=100000
-10^9<=x,y<=10^9
-10^9<=A,B<=10^9
-10^18<=C<=10^18