#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define MOD 998244353 const int N = 1e5 + 1, M = 111; int n, m, q, d[N], mark[N]; vector<int> adj[N]; vector<pair<int, int>> len[N]; void solve() { cin >> n >> m >> q; for (int i = 1, u, v; i <= m; i++) { cin >> u >> v; adj[v].push_back(u); } for (int i = 1; i <= n; i++) { vector<int> t; t.push_back(i); for (int v : adj[i]) for (auto [x, y] : len[v]) { if (mark[y] != i) { mark[y] = i; d[y] = x + 1; t.push_back(y); } else d[y] = max(d[y], x + 1); } for (int v : t) len[i].push_back({d[v], v}); sort(len[i].begin(), len[i].end(), greater<pair<int, int>>()); while (len[i].size() > M) len[i].pop_back(); } memset(mark, 0, 4 * N); for (int i = 1, s, y; i <= q; i++) { cin >> s >> y; for (int j = 1, u; j <= y; j++) { cin >> u; mark[u] = i; } if (y >= M) { memset(d, -1, 4 * N); for (int u = 1; u <= n; u++) { if (mark[u] != i) d[u] = 0; for (int v : adj[u]) if (d[v] != -1) d[u] = max(d[u], d[v] + 1); } cout << d[s] << '\n'; } else { bool ok = 0; for (auto [x, y] : len[s]) { if (mark[y] == i) continue; cout << x << '\n'; ok = 1; break; } if (!ok) cout << -1 << '\n'; } } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll t = 1; // cin >> t; // cout << fixed << setprecision(12); for (ll i = 1; i <= t; i++) { solve(); } }