Given N point on the x-y coordinates, you are to find the rectangle of the smallest area which covers no less than M points. The coordinates of the four vertices must be integers and the sides must be parallel to the axes. If one point lies on the sides of the rectangle, it is not considered as being covered. 

The first line of input is the number of test case.
The first line of each test case contains two integers, N and M (1 ≤ M ≤ N ≤ 200).
The next N line each contain two integers x_i, y_i (1 ≤ x_i, y_i ≤ 10,000) describing the points.
There is a blank line before each test case.

For each test case output the smallest area in a separate line.