## https://yukicoder.me/problems/no/2680

import heapq
from collections import deque

def main():
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
    T = []
    for _ in range(N):
        T.append(list(map(int, input().split())))
    
    queues = [[] for _ in range(M)]
    queue = deque()
    index = 0
    fixed_set = [[] for _ in range(M)]
    for i in range(N):
        queue.append(i)
    while len(queue) > 0 and index < M:

        while len(queue) > 0:
            i = queue.popleft()
            t = T[i][index]
            heapq.heappush(queues[t], -i)
        
        for m in range(M):
            x = A[m] - len(fixed_set[m])
            if x < len(queues[m]):
                z = len(queues[m]) - x
                for _ in range(z):
                    y = heapq.heappop(queues[m])
                    y = -y
                    queue.append(y)
        
        for m in range(M):
            for x in queues[m]:
                fixed_set[m].append(-x)
            queues[m].clear()

        index += 1

    answers = [-1] * N
    for m in range(M):
        for x in fixed_set[m]:
            answers[x] = m
       
    print(" ".join(map(str, answers)))
        
            
            


    
    


if __name__ == "__main__":
    main()