#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations

ipt = sys.stdin.readline

def iin():
    return int(ipt())
def lmin():
    return list(map(int,ipt().split()))

MOD = 998244353
#############################################################

N,M = lmin()
A = lmin()
T = [lmin() for _ in range(N)]

ans = [-1]*N
R = list(range(N))
TT = [[] for _ in range(N)]
for i in range(2*N):
    if not R:
        break
    NR = []
    
    for r in R:
        tar = T[r][i]
        if len(TT[tar]) == A[tar]:
            NR.append(r)
        else:
            TT[tar].append(r)
            ans[r] = tar
    R = NR

print(*ans)