import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
8 3
2 3 3
0 1 2
0 2 1
0 1 2
0 2 1
1 0 2
2 1 0
0 2 1
2 0 1
9 3
1 3 5
0 1 2
0 1 2
0 1 2
1 0 2
1 2 0
0 2 1
0 2 1
1 2 0
1 2 0
21 6
1 2 3 4 5 6
5 3 4 0 1 2
1 2 4 5 3 0
1 4 0 3 2 5
0 4 1 5 2 3
5 4 2 0 1 3
0 1 4 2 3 5
1 3 4 5 0 2
5 1 2 0 4 3
0 1 2 4 5 3
0 2 4 3 5 1
0 1 4 3 2 5
5 3 1 2 4 0
2 3 1 0 5 4
3 0 1 5 2 4
0 5 4 1 2 3
3 2 4 0 1 5
5 3 2 1 4 0
0 3 1 5 2 4
3 1 5 2 0 4
1 0 4 2 5 3
1 3 2 4 5 0
"""

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,M=map(int, input().split())
  A=list(map(int, input().split()))
  T=[list(map(int, input().split())) for _ in range(N)]
  T=[(i,t) for i,t in enumerate(T)]
  now=0
  ans=[-1]*N
  while T:
    tmp=[]
    for t in T:
      if A[t[1][now]]>0:
        A[t[1][now]]-=1
        ans[t[0]]=t[1][now]
      else:
        tmp.append(t)
    T=tmp.copy()
    now+=1
  print(*ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)