import heapq
N,M=map(int,input().split())
A=list(map(int,input().split()))
T=[]
for _ in range(N):
    T.append(list(map(int,input().split())))
hq=[]
for i in range(N):
    for j in range(M):
        heapq.heappush(hq,(j,-T[i][j],i))
use=[False for _ in range(N)]
ans=[[] for _ in range(M)]
while len(hq)>0:
    j,t,i=heapq.heappop(hq)
    t=-t
    if not use[i] and len(ans[t])<A[t]:
        ans[t].append(i)
        use[i]=True
fa=[-1]*N
for i in range(M):
    for a in ans[i]:
        fa[a]=i
print(*fa)