There is a sniper at point S. His mission is to eliminate an enemy of the state, who rides his bicycle along a straight line from point A to point B. The bullet flies along a striaght line with infinite speed. There are n rectangular parallelepipedshaped skyscrapers in the city. The bullet can't fly through the skyscraper but can touch its border. Of course, the sniper will make a deadly shot as soon as possible. Your task is to calculate the coordinates of the enemy at the moment of the shot.
Input
The first line contains spaceseparated coordinates of S: s_{x}, s_{y}, s_{z} (s_{z} ≥ 0). The second line contains spaceseparated coordinates of points A and B: a_{x}, a_{y}, b_{x}, b_{y}. The enemy of the state moves on the surface of earth, so his zcoordinate is always equal to zero. The third line containts an integer n (0 ≤ n ≤ 100). Each of the following n lines contains spaceseparated numbers l_{x}, l_{y}, r_{x}, r_{y}, h (l_{x} < r_{x}; l_{y} < r_{y}; h > 0)—coordinates of the opposite corners of the bottom of the current skyscraper and its height. The sides of the skyscrapers are parallel to the corrdinate axes. All coordinates and heights are integers and don't exceed 100 by their absolute values.
It is guaranteed that no two skyscrapers have common points, the point S doesn't lie inside or on the border of the skyscraper and the segment AB doesn't have common points with any of the skyscrapers.
Output
If the enemy of the state cannot be eliminated, output “Impossible”. In the other case output the coordinates of the enemy of the state precise up to 10^{−7}.
Samples
input  output 

0 0 2
4 4 4 4
2
3 2 1 3 10
1 1 4 2 20
 1.3333333333 4.0000000000

0 0 2
4 1 4 1
1
1 1 3 1 10
 Impossible

Problem Author: Alex Samsonov
Problem Source: Ural SU Contest. Petrozavodsk Winter Session, February 2009