#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 1e5 + 69;
const int B = 320;
int n, m, q, cnt[N], d[N];
vector<int> g[N], in[N];
vector<pair<int, int>> dis[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n >> m >> q;
for (int i = 1;i <= m;i++) {
int a, b;
cin >> a >> b;
if (a > b)
swap(a, b);
g[a].push_back(b);
in[b].push_back(a);
}
for (int i = 1;i <= n;i++) {
priority_queue<pair<int, int>> pq;
pq.push({0, i});
for (auto u : in[i]) {
for (auto x : dis[u]) {
if (pq.size() < B)
pq.push({-(x.f + 1), x.s});
else {
auto t = pq.top();
if (x.f + 1 > abs(t.f)) {
pq.pop();
pq.push({-(x.f + 1), x.s});
}
}
}
}
while (!pq.empty()) {
auto v = pq.top();
pq.pop();
dis[i].push_back({abs(v.f), v.s});
}
}
while (q--) {
int s, c;
cin >> s >> c;
int a[c];
for (int i = 0;i < c;i++) {
cin >> a[i];
cnt[a[i]] = 1;
}
int ans = -cnt[s];
if (c < B) {
for (auto u : dis[s]) {
if (!cnt[u.s])
ans = max(ans, u.f);
}
}
else {
for (int i = 1;i <= n;i++)
d[i] = -1;
d[s] = 0;
for (int i = s;i >= 1;i--) {
if (d[i] >= 0) {
if (!cnt[i])
ans = max(ans, d[i]);
for (auto u : in[i]) {
d[u] = max(d[u], d[i] + 1);
}
}
}
}
cout << ans << '\n';
for (int i = 0;i < c;i++)
cnt[a[i]] = 0;
}
}
return 0;
}
