You are given a point set $S$ with $N$ points ($1\le N\le 10^5$) in $K$-dimensional ($1\le K\le 10$) space.

We define $dis(x,y)$ as the Manhattan distance between $x$ and $y$.

For each point $x$ in $K$-dimensional space, we can calculate a value $d=\max\{y\in S|dis(x,y)\}$.

Your task is to find a point that have minimal $d$.

Note that the point doesn't need to be in $S$.

Input Format

The first line contains two integers $N,K$.

Each of the next $N$ lines contains $K$ integers. The $j$ th integer in $i$ th line is $S_{i,j}$ ($S_{i,j}$ means the $j$ th dimension of $S_i$, $-10^{16}\le S_{i,j}\le 10^{16}$).

Output Format

One line contains $K$ real numbers. Each number should be in range $[-10^{18},10^{18}]$.

We will calculate $d$ using these values. Your answer will be considered correct if its relative or absolute error doesn't exceed $10^{-10}$.