In winter, when days become shorter and nights longer, the issue of clearing the city streets of snow arises. Since the city's budget is very small, there is only one snowplow. Nevertheless, all roads must be cleaned. After each heavy snowfall, the snowplow leaves its garage at night and must travel throughout the city, cleaning all roads. What is the minimum amount of time required for the snowplow to clean all lanes of all roads and return to the garage?
It is known that:
The snowplow can clean only one lane of a road in one pass.
All roads are straight lines with one lane in each direction.
At any intersection, the snowplow can turn in any direction, and it can make a U-turn at a dead end.
While cleaning, the snowplow moves at a speed of km/h; when moving along an already cleaned road, it moves at km/h.
It is always possible to traverse all roads.
The first line contains two numbers and (-30000 \le x, y \le 30000) — the coordinates (in meters) of the garage where the snowplow starts. Each of the following lines contains four numbers — the coordinates (in meters) of the start and end of each street. There can be up to streets in the city.
Output the time in hours and minutes required to clean all roads and return to the garage. Round the time to the nearest minute.
Example 1