// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx,avx2")
// #pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define vi vector<ll>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pl>
#define mi map<ll,ll>
#define mc map<char,int>
#define sortx(X) sort(X.begin(),X.end());
#define all(X) X.begin(),X.end()
#define allr(X) X.rbegin(),X.rend()
#define ln '\n'
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
#define MUN {cout << "-1\n"; return;}
const int MODE = 998244353;
const int MOD2 = (MODE + 1) / 2;
using namespace std;
const ll INF = 1e16;
const ll sq = 120;
void solve(int tc) {
ll n, m, q;
cin >> n >> m >> q;
vii adj(n+1);
vii radj(n+1);
for (int i = 0; i < m; i++)
{
ll u, v; cin >> u >> v;
if (u > v) swap(u, v);
adj[u].push_back(v);
radj[v].push_back(u);
}
vector<vp> dp(n+1);
for (int i = 0; i <= n; i++)
{
dp[i].push_back({0, i});
}
vi vis(n+1);
vi ord;
function<void(ll)> dfs = [&](ll u) {
if (vis[u]) return;
vis[u] = 1;
for (auto neg : adj[u]) {
dfs(neg);
}
ord.push_back(u);
};
for (int i = 1; i <= n; i++) dfs(i);
reverse(all(ord));
vi tmp(n+1);
for (auto u : ord) {
vp Y;
sortx(dp[u]);
for (auto [a, b] : dp[u]) {
if (!tmp[b]) {
tmp[b] = 1;
Y.push_back({a, b});
}
}
swap(Y, dp[u]);
for (auto [a, b] : Y) tmp[b]=0;
while (dp[u].size()>sq) dp[u].pop_back();
for (auto a : dp[u]) {
a.first--;
for (auto neg : adj[u]) {
dp[neg].push_back(a);
}
}
}
while (q--)
{
ll t, m; cin >> t >> m;
vi Y(m);
for (int i = 0; i < m; i++) cin >> Y[i];
sortx(Y);
if (m < sq-1) {
for (auto [a, b] : dp[t]) {
if (!binary_search(all(Y), b)) {
cout << -a << '\n';
goto EE;
}
}
cout << "-1\n";
} else {
vp V(n+1, {-INF, -1});
vi in(n+1, 1);
for (auto a : Y) in[a] = 0;
function<pl(ll)> req = [&](ll u) -> pl {
if (V[u].first != -INF) return V[u];
V[u] = {-INF/2, -1};
if (in[u]) V[u] = {0, u};
for (auto neg : radj[u]) {
auto re = req(neg);
re.first++;
V[u] = max(V[u], re);
}
return V[u];
};
auto re = req(t);
if (re.second == -1) cout << "-1\n";
else cout << re.first << '\n';
}
EE:;
}
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int size = 1;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
// cin >> size;
for (int i = 1; i <= size; i++) solve(i);
}
