#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#define endl '\n'
using namespace std;
int n, m, q;
vector <int> v[100005];
void read()
{
cin >> n >> m >> q;
int x, y;
for(int i = 1; i <= m; i++)
{
cin >> x >> y;
v[y].push_back(x);
}
}
int used[100005];
int maxc;
int dp[100005];
int vis[100005];
int dfs(int u)
{
if(vis[u]) return dp[u];
vis[u] = 1;
int best = -1;
for(auto to : v[u])
{
if(used[to]) continue;
int cur = dfs(to);
if(cur != -1)
best = max(best, cur + 1);
}
if(!used[u])
best = max(best, 0);
return dp[u] = best;
}
void solve_query()
{
for(int i = 1; i <= n; i++)
{
dp[i] = -1;
used[i] = vis[i] = 0;
}
int t, y, x;
cin >> t >> y;
for(int i = 1; i <= y; i++)
{
cin >> x;
used[x] = 1;
}
maxc = dfs(t);
/*for(int i = 1; i <= n; i++)
{
if(d[i] != -1 && used[i] == 0)
{
if(maxc < d[i])maxc = d[i];
}
}*/
cout << maxc << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
read();
for(int i = 1; i <= q; i++)
solve_query();
return 0;
}
