E. Deсart the Grasshopper
time limit per test
1 second
memory limit per test
512 megabytes
input
standard input
output
standard output

A grasshopper named Decart lives on the Cartesian plane. Today, he urgently needs to get from point $$$(x_0, y_0)$$$ to point $$$(x_1, y_1)$$$.

Unfortunately, the grasshopper doesn't have time to think, so he strictly decided to jump $$$n$$$ times, with the length of the $$$i$$$-th jump being exactly $$$a_i$$$, as he just dreamed of such a sequence of numbers.

Help the grasshopper to devise a route from point $$$(x_0, y_0)$$$ to point $$$(x_1, y_1)$$$ using jumps of lengths $$$a_i$$$, or confirm that this is impossible.

Input

The first line contains two integers $$$x_0$$$ and $$$y_0$$$ — the coordinates of the starting point ($$$-1000 \le x_0, y_0 \le 1000$$$).

The second line contains two integers $$$x_1$$$ and $$$y_1$$$ — the coordinates of the ending point ($$$-1000 \le x_1, y_1 \le 1000$$$). Note that the starting and ending points of the grasshopper's route may coincide.

The third line contains a single integer $$$n$$$ — the number of jumps the grasshopper makes ($$$1 \le n \le 10^5$$$).

The fourth line contains $$$n$$$ integers $$$a_1, a_2 \dots a_n$$$ — the desired lengths of the jumps ($$$1 \le a_i \le 1000$$$).

Output

If it is impossible to jump from the starting point to the ending point using the given sequence of jumps, output "Impossible" on the first line.

Otherwise, output "Possible" on the first line, and in the following $$$n$$$ lines, output the coordinates of the points. In the $$$i$$$-th line, two real numbers should be output—the coordinates of the point where the grasshopper will land after the $$$i$$$-th jump.

If there are multiple solutions, any of them is allowed. The following quantities must be equal with a relative or absolute error of no more than $$$10^{-4}$$$:

  • The distance between the $$$(i-1)$$$-th and $$$i$$$-th points in the answer must be equal to $$$a_i$$$;
  • The distance between the starting point and the first point in the answer must be equal to $$$a_1$$$;
  • The coordinates of the $$$n$$$-th point in the answer must be equal to the coordinates of the ending point.
Examples
Input
1 6
5 3
3
2 4 1
Output
Possible
0.14424492 4.19232656
4.02884898 3.23846531
5.00000000 3.00000000
Input
0 0
6 8
5
2 3 4 5 6
Output
Possible
-1.20000000 -1.60000000
-3.00000000 -4.00000000
-0.60000000 -0.80000000
2.40000000 3.20000000
6.00000000 8.00000000
Input
-10 10
10 -10
2
5 5
Output
Impossible
Note

One possible route for the grasshopper for the first test from the example is shown in the figure.