Description

Let (x₁, y₁), …, (x_n, y_n) be a collection of n points in a two-dimensional plane. Your goal is to navigate a robot from point (x₁, y₁) to point (x_n, y_n). From any point (x_i, y_i), the robot may travel to any other point (x_j, y_j) at most R units away at a speed of 1 unit per second. Before it does this, however, the robot must turn until it faces (x_j, y_j); this turning occurs at a rate of 1 degree per second.

Compute the shortest time needed for the robot to travel from point (x₁, y₁) to (x_n, y_n). Assume that the robot initially faces (x_n, y_n). To prevent floating-point precision issues, you should use the double data type instead of float. It is guaranteed that the unrounded shortest time will be no more than 0.4 away from the closest integer. Also, if you decide to use inverse trigonometric functions in your solution (hint, hint!), try atan2() rather than acos() or asin().

Input

The input test file will contain multiple test cases. Each test case will begin with a single line containing an integer R, the maximum distance between points that the robot is allowed to travel (where 10 ≤ R ≤ 1000), and an integer n, the number of points (where 2 ≤ n ≤ 20). The next n lines each contain 2 integer values; here, the ith line contains x_i and y_i (where −1000 ≤ x_i, y_i ≤ 1000). Each of the points is guaranteed to be unique. The end-of-file is denoted by a test case with R = n = −1.

Output

The output test file should contain a single line per test case indicating the shortest possible time in second (rounded to the nearest integer) required for the robot to travel from (x₁, y₁) to (x_n, y_n). If no trip is possible, print “impossible” instead.

10 2
0 0
7 0
10 3
0 0
7 0
14 5
10 3
0 0
7 0
14 10
-1 -1

7
71
impossible

Source

Stanford Local 2006