#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M;
    cin>>N>>M;
    vector<int>A(M);
    for(int i=0;i<M;i++)cin>>A[i];
    vector T(N,vector<int>(M));
    for(int i=0;i<N;i++){
        for(int j=0;j<M;j++){
            cin>>T[i][j];
        }
    }
    vector<bool>ok(N);
    vector<int>s(N);
    vector<vector<int>>V(M);
    vector<int>at(N);
    while(1){
        bool flag=true;
        for(int i=0;i<N;i++){
            if(ok[i])continue;
            ok[i]=true;
            flag=false;
            V[T[i][s[i]]].push_back(i);
        }
        if(flag)break;
        for(int i=0;i<M;i++){
            sort(all(V[i]));
            while(V[i].size()>A[i]){
                ok[V[i].back()]=false;
                s[V[i].back()]++;
                V[i].pop_back();
            }
            A[i]-=V[i].size();
            for(auto x:V[i]){
                at[x]=i;
            }
            V[i].clear();
        }
    }
    for(int i=0;i<N;i++)cout<<at[i]<<" ";
    cout<<"\n";
}