//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si static inline
#define mp make_pair
#define fi first
#define se second
using namespace std;typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;typedef const int ci;
typedef const ll cl;const int iinf=INT_MAX;const ll linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	const int N=605;int n,m,a[N],p[N][N];bool vi[N],Vi[N];
	bool check(int x){
		memset(Vi,0,sizeof(Vi));
		for(int sum=0,i=1;i<=m;i++){
			for(int j=1;vi[p[i][j]]||p[i][j]==x;j++)if(!Vi[p[i][j]])Vi[p[i][j]]=1,sum++;
			if(sum>a[i])return 0;
		}return 1;
	}
	void mian(){
		cin>>n>>m;
		for(int i=1;i<=m;i++)cin>>a[i];
		for(int i=1;i<=m;i++){
			for(int j=1;j<=n;j++)cin>>p[i][j];
		}
		for(int j=1,i=1;i<=n-m;i++){
			while(!check(j))j++;
			vi[j]=1,j++;
		}
		memset(Vi,0,sizeof(Vi));
		for(int sum=0,i=1;i<=m;i++){
			int j=1;
			for(;vi[p[i][j]]||Vi[p[i][j]];j++)if(!Vi[p[i][j]])Vi[p[i][j]]=1,cout<<p[i][j]<<" ";
			Vi[p[i][j]]=1;
		}
		for(int i=1;i<=n;i++)if(!Vi[i])cout<<i<<" ";
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	#endif
//	ios::sync_with_stdio(0);
//	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}