A Segment and Triangles

Two distinct points $P,Q$ and $N$ distinct points $A_1,A_2,\cdots,A_N$ are given on the two-dimensional plane. All $N+2$ points are at distinct positions, and no three of them are collinear.

Choose three points $A_i,A_j,A_k$ with $1\le i<j<$. The positional relationship between the triangle formed by these points and the segment is exactly one of the following four types.

• Type 1: The segment $PQ$ is completely contained in the interior of the triangle.
• Type 2: The segment $PQ$ intersects the boundary of the triangle exactly once.
• Type 3: The segment $PQ$ intersects the boundary of the triangle exactly twice.
• Type 4: The segment $PQ$ and the triangle are disjoint.

For every triangle that can be formed, count how many triangles have each type of relationship.

The input is given from Standard Input in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print one line containing four integers separated by spaces: the numbers of triangles of Type 1, Type 2, Type 3, and Type 4, in this order.

• $1 \le T \le 50\,000$.
• $3 \le N \le 200\,000$.
• The sum of $N$ over all test cases does not exceed .