#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;
const int N = 610;
int n, m, p[N][N], a[N];
int nd[N], sz;
int ar[N], rm, nw, del[N];
bool Check() {
  nw = rm = 0;
  for (int i = 1; i <= n; ++i) del[i] = 0;
  for (int i = 1; i <= m && nw < n - m; ++i) {
    rm += a[i] - a[i - 1];
    for (int j = 1, t; j <= n; ++j) {
      t = p[i][j];
      if (del[t]) continue;
      del[t] = 1;
      if (nd[t]) {
        if (rm) --rm, ar[++nw] = t;
        else
          return 0;
      } else
        break;
    }
  }
  // log("OK.nw=%d\n", nw);
  return 1;
}
int main() {
#ifdef memset0
  freopen("B.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  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 i = 1; i <= n && sz < n - m; ++i) {
    // log("i=%d\n", i);
    nd[i] = 1;
    if (!Check()) nd[i] = 0;
    else
      ++sz;
  }
  Check();
  for (int i = 1; i <= n; ++i)
    if (!del[i]) ar[++nw] = i;
  for (int i = 1; i <= nw; ++i) {
    cout << ar[i] << " \n"[i == nw];
  }
}