The Department of National Defense (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel. Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed $d$, which depends of the power of the transceivers. Higher power yields higher $d$ but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of $d$ is the same for every pair of outposts. Your job is to determine the minimum $d$ required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts. \InputFile The first line contains the number $n$ of test cases. The first line of each test case contains the number of satellite channels $s~(1 \le s \le 100)$ and the number of outposts $p~(s < p \le 500)$. $p$ lines follow, giving the $(x, y)$ coordinates of each outpost in km (coordinates are integers between $0$ and $10000$). \OutputFile For each case print the minimum $d$ required to connect the network. Output should be specified to $2$ decimal points. \includegraphics{https://eolympusercontent.com/images/ag8gikm3l11k5bq837629kc33c.gif}