Column maximums

You are given an $m \times n$ matrix. Find the largest element of each column.

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

A single line with $n$ numbers: the $j$-th is the maximum of column $j$.

To walk down a column, the outer loop goes over columns ($j$) and the inner loop over rows ($i$): element $a_{ij}$. Start from the first element of the column, not from $0$ (all numbers are negative in the second example).