#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=1010;
int N, M, K;
vector<int>G[maxn];
int indegree[maxn], temp[maxn];
int main(){
int a, b;
scanf("%d%d", &N, &M);
for(int i=1; i<=M; i++){
scanf("%d%d", &a, &b);
G[a].push_back(b);
indegree[b]++;
}
scanf("%d", &K);
int flag=0;
for(int j=0; j<K; j++){
for(int i=1; i<=N; i++)temp[i]=indegree[i];
int judge=1;
for(int i=1; i<=N; i++){
int num;
scanf("%d", &num);
if(judge==0)continue;
if(temp[num]==0){
for(int p=0; p<G[num].size(); p++){
temp[G[num][p]]--;
}
}else{
if(flag)printf(" ");
printf("%d", j);
flag=1;
judge=0;
}
}
}
return 0;
}