Mirko has written down ~N~ real numbers with finite decimal notation. Next, for each number, he wrote down the arithmetic sequence that begins with ~0~ and its difference is the current number. For example, if the current number is ~x~, the corresponding arithmetic sequence will be ~0, x, 2x, 3x, 4x, \dots~.

On another piece of paper, Mirko has written down all members of all obtained ~N~ sequences that are in the interval ~[A, B]~, sorted in ascending order, removing possible duplicates. The next day, he seems to have lost the first paper and wants to reconstruct the initial numbers based on the second piece of paper. Help him!

Input Specification

The first line of input contains a natural number ~K~, smaller than or equal to ~50~, the number of different elements in Mirko's sequences in the interval ~[A, B]~.

The second line contains integers ~A~ and ~B~ ~(1 \le A < B \le 10^6)~.

Each of the following ~K~ lines contains the ~K~ described numbers, sorted in ascending order. These will be real numbers with at most ~5~ decimal places.

Output Specification

You must output ~N~ lines, where ~N~ is the size of Mirko's set of initial numbers, containing Mirko's (mutually distinct) initial numbers, in any order.

If multiple possible sets exist, output the one containing the smallest amount of numbers (the one with the smallest ~N~), and if there are multiple such sets, output any.

Scoring

In test cases worth ~50\%~ of total points, all numbers in the input will be natural.

Sample Input 1

4
1 2
1
1.4
1.5
2

Sample Output 1

0.5
0.7

Explanation for Sample Output 1

Another correct solution is 0.5, 1.4.

Sample Input 2

5
10 25
12
13.5
18
20.25
24

Sample Output 2

6.0
6.75