#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1205;

int in[N],vis[N];
int ans[N];
int n,m,ti[N],p[N][N];

bool chk(){
    for(int i = 1;i <= n;i ++) vis[i] = 0;
    int l = 0;
    for(int i = 1;i <= m;i ++){
        for(int j = 1;j <= n;j ++){
            if(in[p[i][j]] && !vis[p[i][j]]){
                vis[p[i][j]] = 1;
                ans[++ l] = p[i][j];
                if(l > ti[i]) return 0;
            }
            if(!in[p[i][j]]) break;
        }
    }
    for(int i = 1;i <= n;i ++) if(in[i] && !vis[i]) ans[++ l] = i;
    return 1;
}

void solve(){
    cin >> n >> m;
    for(int i = 1;i <= m;i ++) cin >> ti[i];
    for(int i = 1;i <= m;i ++){
        for(int j = 1;j <= n;j ++){
            cin >> p[i][j];
        }
    }
    for(int i = 1;i <= n;i ++){
        in[i] = 1;
        if(!chk()) in[i] = 0;
    }
    chk();
    for(int i = 1;i <= n - m;i ++) cout << ans[i] << " \n"[i == n - m];
}

int main(){
    ios::sync_with_stdio(false);
    solve();
    return 0;
}