Time Limit: 6000/3000MS (Java/Others) Memory Limit: 12000/6000KB (Java/Others)
Give you N points on an plane，the coordinates of each point are integers。
Can you cover all the N points using no more than M triangles ？
If you can，can you tell me the minimum area of the maximum area of all the M triangles？
You should note that each vertice of a triangle should be one of the N points，
Covering means that all points should be within the triangles or on the edge of any triangle.
The first line is an integer T(1<=T<=100) ，the number of test cases;
For each test case，
N (3<=N<=18)，the number of points，M，meaning tthe maximum number of trianlges
The following N lines is the coordinates
all numbers will between 0 and 29999.
A decimal number ，the minimum area descripts above or -1.0 if covering is failed.