Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Beru-taxi

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasiliy lives at point (*a*, *b*) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested *n* available Beru-taxi nearby. The *i*-th taxi is located at point (*x*_{i}, *y*_{i}) and moves with a speed *v*_{i}.

Consider that each of *n* drivers will move directly to Vasiliy and with a maximum possible speed. Compute the minimum time when Vasiliy will get in any of Beru-taxi cars.

Input

The first line of the input contains two integers *a* and *b* ( - 100 ≤ *a*, *b* ≤ 100) — coordinates of Vasiliy's home.

The second line contains a single integer *n* (1 ≤ *n* ≤ 1000) — the number of available Beru-taxi cars nearby.

The *i*-th of the following *n* lines contains three integers *x*_{i}, *y*_{i} and *v*_{i} ( - 100 ≤ *x*_{i}, *y*_{i} ≤ 100, 1 ≤ *v*_{i} ≤ 100) — the coordinates of the *i*-th car and its speed.

It's allowed that several cars are located at the same point. Also, cars may be located at exactly the same point where Vasiliy lives.

Output

Print a single real value — the minimum time Vasiliy needs to get in any of the Beru-taxi cars. You answer will be considered correct if its absolute or relative error does not exceed 10^{ - 6}.

Namely: let's assume that your answer is *a*, and the answer of the jury is *b*. The checker program will consider your answer correct, if .

Examples

Input

0 0

2

2 0 1

0 2 2

Output

1.00000000000000000000

Input

1 3

3

3 3 2

-2 3 6

-2 7 10

Output

0.50000000000000000000

Note

In the first sample, first taxi will get to Vasiliy in time 2, and second will do this in time 1, therefore 1 is the answer.

In the second sample, cars 2 and 3 will arrive simultaneously.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/22/2018 03:03:25 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|