import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
n,m = map(int,input().split())
a = list(map(int,input().split()))
hope = [list(map(int,input().split())) for i in range(n)]
ans = [-1 for i in range(n)]
room = [[] for i in range(m)]
kakutei = [0 for i in range(m)]
for j in range(m):
    for i in range(n):
        if ans[i] == -1:
            heapq.heappush(room[hope[i][j]],-i)
    for j in range(m):
        if len(room[j]) >= a[j]:
            while len(room[j]) > a[j]:
                heapq.heappop(room[j])
        for i in room[j]:
            ans[-i] = j
            a[j] -= 1
        room[j].clear()
    #print(room)
print(*ans)