当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
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 xi, yi (1 ≤ xi, yi ≤ 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.
5 2 1 200 6 100 5 2 2 200 6 100 5 2 1 1 1 1 1 2 2 1 1 1 1 8 5 5 7 6 6 6 8 7 5 7 9 8 6 8 8 9 7
4 306 4 4 20
| 时间上限 | 内存上限 |
| 1000 | 65536 |