Sequence Center

You are given $k$ integer sequences of length $n$. The distance between sequences $A=(a_1,\ldots,a_n)$ and $B=(b_1,\ldots,b_n)$ is $d(A,B)=\sum_{i=1}^{n}|a_i-b_i|$. Find an integer sequence $C$ that minimizes $\max_i d(A_i,C)$ over the given sequences. Any optimal sequence is accepted.

The first line contains $n$ and $k$ ($2\le n\le 100000$, $2\le k\le 5$). Each of the next $k$ lines has $n$ integers, the absolute values are at most $10^9$.

Print the $n$ integers of a center sequence separated by single spaces.