{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e The country of jiuye composed by N cites. Each city can be viewed as a point in a two- dimensional plane with integer coordinates (x,y). The distance between city i and city j is defined by d\u003csub\u003eij\u003c/sub\u003e \u003d |x\u003csub\u003ei\u003c/sub\u003e - x\u003csub\u003ej\u003c/sub\u003e| + |y\u003csub\u003ei\u003c/sub\u003e - y\u003csub\u003ej\u003c/sub\u003e|. jiuye want to setup airport in K cities among N cities. So he need your help to choose these K cities, to minimize the maximum distance to the nearest airport of each city. That is , if we define d\u003csub\u003ei\u003c/sub\u003e(1 ≤ i ≤ N ) as the distance from city i to the nearest city with airport. Your aim is to minimize the value max{d\u003csub\u003ei\u003c/sub\u003e|1 ≤ i ≤ N }. You just output the minimum.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":" The first line of the input is T (1 ≤ T ≤ 100), which stands for the number of test cases you need to solve.\u003cbr\u003e\u003cbr\u003e The first line of each case contains two integers N ,K (1 ≤ N ≤ 60,1 ≤ K ≤ N ),as mentioned above.\u003cbr\u003e\u003cbr\u003e The next N lines, each lines contains two integer x\u003csub\u003ei\u003c/sub\u003e and y\u003csub\u003ei\u003c/sub\u003e (-10\u003csup\u003e9\u003c/sup\u003e ≤ x\u003csub\u003ei\u003c/sub\u003e, y\u003csub\u003ei\u003c/sub\u003e ≤ 10\u003csup\u003e9\u003c/sup\u003e), denote the coordinates of city i."}},{"title":"Output","value":{"format":"HTML","content":" For each test case, print a line “Case #t: ”(without quotes, t means the index of the test case) at the beginning. Then a single integer means the minimum."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n3 2\r\n0 0\r\n4 0\r\n5 1\r\n4 2\r\n0 3\r\n1 0\r\n3 0\r\n8 9\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 2\r\nCase #2: 4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}