import sys
input = sys.stdin.readline


class BipartiteMatching:
    def __init__(self, V):
        self.V = V
        self.G = [[] for _ in range(V)]

    def add_edge(self, u, v):
        self.G[u].append(v)
        self.G[v].append(u)

    def dfs(self, u):
        self.used[u] = True
        for v in self.G[u]:
            w = self.match[v]
            if w < 0 or (not self.used[w] and self.dfs(w)):
                self.match[u] = v
                self.match[v] = u
                return True
        return False

    def bipartite_matching(self):
        res = 0
        self.match = [-1] * self.V
        for v in range(self.V):
            if self.match[v] == -1:
                self.used = [False] * self.V
                if self.dfs(v):
                    res += 1
        return res


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

for _ in range(M):
    bm = BipartiteMatching(2*N)
    for i in range(N):
        for j in range(N):
            if A[i][j]:
                bm.add_edge(i, N+j)
    bm.bipartite_matching()
    ans = [0]*N
    for i in range(N):
        j = bm.match[i] - N
        A[i][j] -= 1
        ans[i] = j+1
    print(*ans)