#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
setIO();
int n, m, q;
cin >> n >> m >> q;
vector<vector<int> > graph(n+1);
for(int i=0; i<m; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
}
while(q--) {
int ep, c;
cin >> ep >> c;
vector<bool> bad(n+1);
for(int i=0; i<c; i++) {
int x;
cin >> x;
bad[x] = 1;
}
int ans = 1e9;
for(int i=1; i<=n; i++) {
if(bad[i]) continue;
vector<bool> vis(n+1);
vector<int> dist(n+1, 1e9);
priority_queue<pii, vector<pii>, greater<pii> > pq;
dist[i] = 0;
pq.push({ 0, i });
while(!pq.empty()) {
int u = pq.top().second;
pq.pop();
if(vis[u]) continue;
vis[u] = 1;
for(int &v : graph[u]) {
if(dist[v] > dist[u] - 1) {
dist[v] = dist[u] - 1;
pq.push({ dist[v], v });
}
}
}
ans = min(ans, dist[ep]);
}
cout << (ans == 1e9 ? -1 : abs(ans)) << '\n';
}
return 0;
}
