Your friend has a matrix $A$ of order $n \times m$. And you want his matrix to play. But he will give you his matrix only when you return his matrix in a $\text sorted$ form and printed in the format as shown. Smallest element must be at index $(1,1)$

Input

First line contain two integer denoting $n$ and $m$ respectively.

Next $n$ lines contains $m$ space seperated integers denoting $A_{ij}$

Output

Print $n$ lines containg $m$ sapce seperated integers where each $A_{ij}$ must be in the format specified.

Constraint

$1<= n,m <= 500$

$0 < A_{ij} <= 10^6$