Two segments and [C, D] are given on the plane by the coordinates of their endpoints: points , , , and with coordinates (X_A, Y_A), (X_B, Y_B), (X_C, Y_C), (X_D, Y_D).
Determine the intersection of these segments and output:
the word Empty if the segments do not intersect;
the coordinates of the intersection point if the intersection consists of a single point;
the coordinates of the endpoints of the intersection segment in lexicographical order, if the intersection is a segment.
The input consists of four lines, each containing two integers, representing the coordinates of points , , , and . The absolute value of each integer does not exceed . The segments may be degenerate.
Numeric values in the output should be rounded to digits after the decimal point.
Example 1