### Radar

Time Limit: 1000 ms
Memory Limit: 65536 KiB

#### Problem Description

N cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar stations but only K operators, we can at most operate K radars. All radars have the same circular coverage with a radius of R. Our goal is to minimize R while covering the entire city with no more than K radars.

#### Input

The input consists of several test cases. The first line of the input consists of an integer T, indicating the number of test cases. The first line of each test case consists of 3 integers: N, M, K, representing the number of cities, the number of radar stations and the number of operators. Each of the following N lines consists of the coordinate of a city. Each of the last M lines consists of the coordinate of a radar station.

All coordinates are separated by one space.

Technical Specification

1. 1 ≤ T ≤ 20

2. 1 ≤ N, M ≤ 50

3. 1 ≤ K ≤ M

4. 0 ≤ X, Y ≤ 1000

All coordinates are separated by one space.

Technical Specification

1. 1 ≤ T ≤ 20

2. 1 ≤ N, M ≤ 50

3. 1 ≤ K ≤ M

4. 0 ≤ X, Y ≤ 1000

#### Output

For each test case, output the radius on a single line, rounded to six fractional digits.

#### Sample Input

1 3 3 2 3 4 3 1 5 4 1 1 2 2 3 3

#### Sample Output

2.236068

#### Hint

#### Source

The 4th Baidu Cup Central China Invitational Programming Contest WHU