2 \(s / 128\) \(MB / 120\) points

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\)

, 2 \(x\)

, 3 \(x\)

, 4 \(x\)

, ...

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!

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

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 ≤ \(A\)

< \(B\)

≤ 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.

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.

생성자가 기록되지 않았습니다.

출처 COCI 2016/2017 Contest 4