Taxi

Time Limit: 1 Second
Memory Limit: 32768 KB

As we all know, it often rains suddenly in Hangzhou during summer time.I suffered
a heavy rain when I was walking on the street yesterday, so I decided to take a
taxi back school. I found that there were *n* people on the street trying to
take taxis, and *m* taxicabs on the street then. Supposing that the cars
waited still and each person walked at a speed of *v*, now given the positions
of the *n* persons and the *m* taxicabs, you should find the minimum time
needed for all the persons to get on the taxicabs. Assume that no two people got on
the same taxicab.

**Input**

For each case, you are given two integers 0 <= *n* <= 100 and *n*
<= *m* <= 100 on the first line, then *n* lines, each has two
integers 0 <= *Xi*, *Yi* <= 1000000 describing the position of the
ith person, then *m* lines, each has two integers 0 <= *xi*, *yi*
<= 1000000 describing the position the ith taxicab, then a line has a float
0.00001 < *v* <= 10000000 which is the speed of the people.

**Output**

You shuold figue out one float rounded to two decimal digits for each case.

**Sample Input**

2 3
0 0
0 1
1 0
1 1
2 1
1

**Sample Output**

1.00

Author:

**LIU, Xiao**
Source:

**ZOJ Monthly, January 2009**
Submit
Status