#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
//using Graph = vector<vector<pair<int,int>>>;
using Graph = vector<vector<int>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

ll sqrtll(ll x) {
  assert(x >= 0);
  ll hi(x), lo(0);
  while (hi != lo) {
    ll y = (hi + lo + 1) / 2;
    if (y <= x/y) lo = y;
    else hi = y - 1;
  }
  return lo;
}


int main(){
  // input 
  int N,M; cin >> N >> M;
  vector<int> A(M);
  for(int i = 0; i < M; i++)
    cin >> A[i];
  vector<vector<int>> T(N,vector<int>(M));
  for(int i = 0; i < N; i++)
    for(int j = 0; j < M; j++)
      cin >> T[i][j];
  
  // solve
  vector<int> ans(N,-1);
  for(int j = 0; j < M; j++){
    for(int i = 0; i < N; i++){
      if(A[T[i][j]] > 0 && ans[i] == -1){
        ans[i] = T[i][j];
        A[T[i][j]]--;
      }
    }
  }
  
  
  // output
  for(int i = 0; i < N; i++){
    if(i) cout << " ";
    cout << ans[i];
  } cout << endl;
}