#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 dist[100005];
struct edge
{
int ver, cost;
bool operator< (const edge& e)const
{
return dist[ver] < dist[e.ver];
}
};
void init()
{
for(int i1 = 1; i1 <= n; i1++)
dist[i1] = -1;
}
void dijkstra(int beg)
{
init();
priority_queue <edge> pq;
dist[beg] = 0;
if(used[beg] == 0)maxc = 0;
pq.push({beg, 0});
while(!pq.empty())
{
int ver = pq.top().ver;
///cout << ver << endl;
pq.pop();
for(int i1 = 0; i1 < v[ver].size(); i1++)
{
if(dist[v[ver][i1]] < dist[ver] + 1)
{
dist[v[ver][i1]] = dist[ver] + 1;
if(used[v[ver][i1]] == 0)
maxc = max(maxc, dist[v[ver][i1]]);
pq.push({v[ver][i1], dist[v[ver][i1]]});
}
}
}
}
void solve_query()
{
int t, y, x;
cin >> t >> y;
for(int i = 1; i <= y; i++)
{
cin >> x;
used[x] = 1;
}
maxc = -1;
dijkstra(t);
/*for(int i = 1; i <= n; i++)
{
if(dist[i] != -1 && used[i] == 0)
{
if(maxc < dist[i])maxc = dist[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;
}
