R,P=range,print
def J():
	return map(int,input().split())
N,M=J()
L=R(N)
A=[0]*N
Z=[i for i in R(N)]
for i in L:A[i]=list(J())
Q=[[0]*N for m in R(M)]
for m in R(M):
	B=[1]*N
	for i in L:
		c=-1
		for k in R(i,N):
			d=sum(A[k][j]*B[j]<1for j in R(N))
			if c<d:c,e=d,k
		A[i],A[e],Z[i],Z[e]=A[e],A[i],Z[e],Z[i]
		for j in L:
			if A[i][j]*B[j]:
				A[i][j]-=1
				B[j],Q[m][Z[i]]=0,j+1
				break
		else:P(-1),exit(0)
for a in A:
	if sum(a)>0:P(-1),exit(0)
for q in Q:P(*q)