Problem Description
An enemy state of our country is occupying an island of ours. They take lots of warships around the island. Communications among the warships are transited by wireless signal, but we have to separate the warships so that at least ONE pair of warships cannot communicate with each other.
For that purpose, we create a kind of Wireless Signal Shielding Device (WSSD) that WSSD can shield the wireless signal in its shielding circle with radius R.
The factories could produce enough WSSDs and our patrol team discovered a lot of places that could be installed with WSSDs. In order to separate the warships, we need to know the minimum value of radius R, smaller R is better because of the cost of manufacture.
Please notice that because of the inflection of wireless signal, two warships can communicate with each other even there is no sight view between them.
Input
The input contains multiply test cases.
The first line of each test case consists of two integers, n, m (0 < n, m <= 10000), which are the number of places where we can install WSSDs and the number of warships. Each of the next n lines contains two integers, indicating the coordinate of the place where we can install WSSDs. The next m lines indicate the coordinates of warships.
The last test case is followed by a single line with two zeros which should not be processed.
Please notice that all the values of coordinates are between -10000 to 10000, and no two coordinates have the same value.
Output
Output the minimum R with two fractional digits.
Sample Input
4 3
-1 0
1 0
0 1
0 -1
10 0
9 0
0 0
4 3
-1 0
1 0
0 1
0 -1
10 0
9 0
-9 0
0 0
Sample Output
0.71
8.00
