Remove the minimum's column

You are given an $m \times n$ matrix. Remove the column that contains its smallest element. If there are several minimums, remove the column of the first one in row order (left to right, top to bottom).

The first line contains $m$ and $n$ ($1 \le m \le 100$, $2 \le n \le 100$). The next $m$ lines contain the matrix ($|a_{ij}| \le 10^9$).

$m$ lines with $n - 1$ numbers each — the changed matrix.

First find the column of the minimum over the whole matrix (update only on a strictly smaller value so that the first one stays), then print every row without that column. In the second example $1$ occurs twice; the first is in column 2.