Description

A super knight moves in the infinite n-dimensional space. Each move it can perform is described by a vector – a vector (a₁, a₂, …, a_n) indicates that a move from the square (with coordinates) (x₁, x₂, …, x_n) to the square (x₁ + a₁, x₂ + a₂, …, x_n + a_n) or (x₁ − a₁, x₂ − a₂, …, x_n − a_n) is possible. Each knight has a prescribed set of such vectors, describing the moves this knight can make. For each knight we assume that this knight can reach anywhere in the space if it is allowed (but actually disallowed) to move along a fractional part of a vector.

We say two knights are equivalent, if they can reach exactly the same squares starting from the square (0, 0, …, 0) (by making many moves, perhaps). (Let us point out that equivalent knights may reach these squares in different number of moves). It can be shown that for every knight there exists an equivalent one whose moves are described by only n vectors.

Given a set of  m (m > n) vectors describing the moves of a super knight, determine an equivalent knight as mentioned above.

Input

The input contains exactly one test case. The first line of input contains two integers m and n (2 ≤ n < m ≤ 100, n ≤ 10, n · m ≤ 200). The next m lines each contains an integral n-dimensional vector (a₁, a₂, …, a_n). It is guaranteed that for all i (1 ≤ i ≤ n) if n = 2, |a_i| ≤ 10³, otherwise |a_i| ≤ 10².

Output

Output n n-dimensional vectors describing the moves of an equivalent knight, each on a separate line.

3 2
1 0
0 5
0 7

1 0
0 1

Hint

Do not output any number longer than 50 digits. The test cases are designed that to each one there is a solution not involving any number exceeding 10²⁰ by magnitude.

Source

POJ Monthly--2007.06.03, Lei, Tao