/**
* author: Jotinha (ツ)
* created: 02-28-2025 11:09:44
**/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
vector<vector<int>> g(n);
for(int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
--u, --v;
g[u].push_back(v);
g[v].push_back(u);
}
vector<int> tot(n);
vector<vector<pair<int, vector<int>>>> qr(n);
int t = 0;
for(int i = 0; i < q; i++) {
int u, k;
cin >> u >> k;
--u;
vector<int> v(k);
for(int& j : v) {
cin >> j;
--j;
}
qr[u].emplace_back(make_pair(t++, v));
tot[u] += (int) v.size();
}
auto bfs = [&](int u) {
vector<int> dist(n, -1);
queue<int> qe;
qe.emplace(u);
dist[u] = 0;
while(!qe.empty()) {
auto v = qe.front();
qe.pop();
for(int nxt : g[v]) {
if(nxt < v && dist[nxt] < dist[v] + 1) {
dist[nxt] = dist[v] + 1;
qe.push(nxt);
}
}
}
return dist;
};
const int sq = 448;
const int inf = 0x3f3f3f3f;
vector<vector<pair<int, int>>> dp(n, vector<pair<int, int>> (sq, make_pair(-inf, inf)));
for(int i = 0; i < n; i++) {
dp[i][0] = {0, i};
}
function<void(int)> dfs = [&](int u) {
for(int nxt : g[u]) {
if(nxt < u) {
dfs(nxt);
vector<pair<int, int>> wait;
for(int i = 0; i < sq; i++) {
wait.emplace_back(dp[nxt][i].first + 1, dp[nxt][i].second);
wait.emplace_back(dp[u][i]);
}
sort(wait.rbegin(), wait.rend());
wait.erase(unique(wait.begin(), wait.end()), wait.end());
for(int i = 0; i < sq; i++) {
dp[u][i] = wait[i];
}
}
}
};
vector<int> ans(t, -1);
for(int i = n - 1; i >= 0; i--) {
if(tot[i] >= sq) {
auto dist = bfs(i);
multiset<int> ms(dist.begin(), dist.end());
ms.insert(-1);
for(int j = 0; j < qr[i].size(); j++) {
for(int nxt : qr[i][j].second) {
ms.erase(ms.find(dist[nxt]));
}
ans[qr[i][j].first] = *ms.rbegin();
for(int nxt : qr[i][j].second) {
ms.insert(dist[nxt]);
}
}
} else {
dfs(i);
for(int j = 0; j < sq; j++) {
for(int k = 0; k < qr[i].size(); k++) {
if(ans[qr[i][k].first] == -1) {
int show = 1;
for(int nxt : qr[i][k].second) {
if(nxt == dp[i][j].second) {
show = 0;
break;
}
}
if(show) {
ans[qr[i][k].first] = dp[i][j].first;
}
}
}
}
}
}
for(int x : ans) {
cout << (x < 0 ? -1 : x) << '\n';
}
return 0;
}
