#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;

#define fr first
#define sc second

#define vc vector
#define pb push_back

#define all(x) x.begin() , x.end()

#define Heh ios::sync_with_stdio(false) , cin.tie(0)

/*
const int MAXN = 1e3 + 13;
const ld err = 1e-12;

int par[MAXN] , rnk[MAXN];

int get(int v){return par[v] = (par[v] == v ? v : get(par[v]));}
void uni(int a , int b){
  a = get(a) , b = get(b);
  if(a == b) return;
  if(rnk[a] < rnk[b]) swap(a , b);
  par[b] = a;
  rnk[a] += rnk[b];
}

ld dis(ld a , ld b , ld c , ld d){
  return sqrt((a - c) * (a - c) + (b - d) * (b - d));
}
*/

ll pw(ll a , ll b , ll mod){
  ll ret = 1;
  while(b){
    if(b&1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return ret;
}

/*
const int MAXN = 3e5 + 35 , p = 313 , mod = 1e9 + 7;

string s;
int n , hsh[MAXN] , pp[MAXN] , inv[MAXN];

int hshsub(int l , int r){
  int ret = hsh[r];
  if(l){
    ret -= hsh[l-1];
    if(ret < 0) ret += mod;
  }
  ret = (1ll * ret * inv[l]) % mod;
  return ret;
}
*/

int main(){
  Heh;
  int n , m;
  cin >> n >> m;
  int c[m];
  for(int i = 0 ; i < m ; i++) cin >> c[i];
  vc<int> pn[n];
  cin.ignore();
  for(int i = 0 ; i < n ; i++){
    string s;
    getline(cin , s);
    s += ' ';
    string t;
    for(char c : s){
      if(c == ' '){
	if(t == "") continue;
	pn[i].pb(stoi(t) - 1);
	t = "";
      }
      else t += c;
    }
  }
  vc<int> pm[m];
  map<int,int> mpn[m];
  for(int i = 0 ; i < m ; i++){
    string s;
    getline(cin , s);
    s += ' ';
    string t;
    for(char c : s){
      if(c == ' '){
	if(t == "") continue;
	pm[i].pb(stoi(t) - 1);
	t = "";
      }
      else t += c;
    }
    for(int j = 0 ; j < (int)pm[i].size() ; j++){
      mpn[i][pm[i][j]] = j;
    }
  }
  int pt[n] = {};
  set<int> atr[m];
  queue<int> nos;
  for(int i = 0 ; i < n ; i++) nos.push(i);
  while(nos.size()){
    int i = nos.front();
    nos.pop();
    while(pt[i] < pn[i].size()){
      int j = pn[i][pt[i]];
      if((int)atr[j].size() < c[j]){
	atr[j].insert(mpn[j][i]);
	break;
      }
      else if(*prev(atr[j].end()) > mpn[j][i]){
	int k = pm[j][*prev(atr[j].end())];
	atr[j].erase(prev(atr[j].end()));
	nos.push(k);
	atr[j].insert(mpn[j][i]);
	break;
      }
      pt[i]++;
    }
  }
  vc<int> ans;
  for(int i = 0 ; i < m ; i++){
    while(atr[i].size()){
      ans.pb(pm[i][*atr[i].begin()]);
      atr[i].erase(atr[i].begin());
    }
  }
  sort(all(ans));
  for(int x : ans) cout << x+1 << endl;
}