import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

from collections import deque
class Dinic:
    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]

    def add_edge(self, fr, to, cap):
        forward = [to, cap, None]
        forward[2] = backward = [fr, 0, forward]
        self.G[fr].append(forward)
        self.G[to].append(backward)

    def add_multi_edge(self, v1, v2, cap1, cap2):
        edge1 = [v2, cap1, None]
        edge1[2] = edge2 = [v1, cap2, edge1]
        self.G[v1].append(edge1)
        self.G[v2].append(edge2)

    def bfs(self, s, t):
        self.level = level = [None]*self.N
        deq = deque([s])
        level[s] = 0
        G = self.G
        while deq:
            v = deq.popleft()
            lv = level[v] + 1
            for w, cap, _ in G[v]:
                if cap and level[w] is None:
                    level[w] = lv
                    deq.append(w)
        return level[t] is not None

    def dfs(self, v, t, f):
        if v == t:
            return f
        level = self.level
        for e in self.it[v]:
            w, cap, rev = e
            if cap and level[v] < level[w]:
                d = self.dfs(w, t, min(f, cap))
                if d:
                    e[1] -= d
                    rev[1] += d
                    return d
        return 0

    def flow(self, s, t):
        flow = 0
        INF = 10**9 + 7
        G = self.G
        while self.bfs(s, t):
            *self.it, = map(iter, self.G)
            f = INF
            while f:
                f = self.dfs(s, t, INF)
                flow += f
        return flow

N,M = mi()
A = [li() for i in range(N)]

if any(sum(A[i])!=M for i in range(N)):
    exit(print(-1))
if any(sum(A[i][j] for i in range(N))!=M for j in range(N)):
    exit(print(-1))
    
res = []
for _ in range(M):
    G = Dinic(2+2*N)
    s,t = 2*N,2*N+1
    for i in range(N):
        G.add_edge(s,i,1)
        for j in range(N):
            G.add_edge(i,N+j,A[i][j])
    for j in range(N):
        G.add_edge(N+j,t,1)
    
    F = G.flow(s,t)
    if F!=N:
        exit(print(-1))
    
    P = [-1] * N
    for i in range(N):
        for e in G.G[i]:
            to,cap,_ = e
            if N <= to < 2*N:
                j = to - N
                if cap == A[i][j]-1:
                    P[i] = j+1
                    A[i][j] -= 1
    res.append(P)

for P in res:
    print(*P)