n,m = map(int, input().split())
alist = list(map(int, input().split()))

tlist = [list(map(int, input().split())) for i in range(n)]

que = list(range(n)[::-1])

cntlist = [0 for i in range(m)]
ans = [0 for i in range(n)]

for i in range(m):
    nq = []

    while que:
        hito = que.pop()
        heya = tlist[hito][i]

        if cntlist[heya] < alist[heya]:
            cntlist[heya] += 1
            ans[hito] = heya
        else:
            nq.append(hito)
    
    que = sorted(nq, reverse=True)

print(*ans)