// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 610;
int n, a[N], m, p[N][N], id[N], ss;
bool vis[N], vv[N];
bool check() {
	F(i, 1, n) vv[i] = true;
	int res = 0;
	F(i, 1, n - m) {
		res++;
		if (id[i]) {
			F(j, 1, n) {
				if (vis[p[id[i]][j]]) {
					if (vv[p[id[i]][j]]) {
						if (--res < 0) {
							// debug << "fuck"
							return false;
						}
						vv[p[id[i]][j]] = false;
					}
				} else break;
			}
		}
	}
	return true;
}
void doit() {
	F(i, 1, n) vv[i] = true;
	F(i, 1, n - m) {
		if (id[i]) {
			F(j, 1, n) {
				if (vis[p[id[i]][j]]) {
					if (vv[p[id[i]][j]]) {
						// debug << i << " " << j << endl;
						cout << p[id[i]][j] << ' ';
						vv[p[id[i]][j]] = false;
					}
				} else break;
			}
		}
	}
	F(i, 1, n)
		if (vis[i] && vv[i]) cout << i << ' ';
}
signed main() {
	read(n), read(m);
	F(i, 1, m) read(a[i]), id[a[i]] = i;
	F(i, 1, m)
		F(j, 1, n)
			read(p[i][j]);
	// debug << "OK\n";
	F(i, 1, n) {
		vis[i] = true;
		// debug << i << endl;
		if (++ss > n - m || !check()) vis[i] = false, ss--;
	}
	// F(i, 1, n)
	// 	if (vis[i]) cout << i << " "; cout << endl;
	doit();
	return 0;
}
/* why?
*/