from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline


N,M = map(int,input().split())
A = [list(map(int,input().split())) for _ in range(N)]
if any(sum(a)!=M for a in A):
    print(-1)
    exit()

if any(sum([A[i][j] for i in range(N)])!=M for j in range(N)):
    print(-1)
    exit()

ans = []
while max(max(A[i]) for i in range(N)):
    
    tmp = [-1]*N
    for i in range(N):
        for j in range(N):
            if A[j][i]!=0:
                if tmp[j]==-1:
                    tmp[j]=i+1
                    A[j][i]-=1
                    break
    ans.append(tuple(tmp))
for a in ans:
    print(*a)