#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair
#define IOS ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define FOR(i, j, n) for (int i = j; i<= n; i++)
#define ROF(i, n, j) for (int i = n; i>= j; i--)
#define pb push_back
#define sep cout << "--------" << endl;
const int mn = 1e5 + 5, sq = 0, msq = sq + 10;
vector<int> a[mn];
vector<int> y[mn];
pii ans[mn][msq];
int dp[mn], p[mn];
bool mark[mn];
int n;
void cle()
{
FOR(i, 1, n)
{
dp[i] = 0;
mark[i] = 0;
}
}
int get(int t, int ind)
{
int siz = y[ind].size();
for(auto v: y[ind]) mark[v] = 1;
FOR(i, 1, t)
{
int maxi;
if (mark[i]) maxi = -1;
else maxi = 0;
for(auto v: a[i])
{
maxi = max(maxi, dp[v]+1);
}
dp[i] = maxi;
}
int tmp = dp[t];
cle();
return tmp;
}
int main()
{
IOS;
int u, v,m , q;
cin >> n >> m >> q;
FOR(i, 1, m)
{
cin >> u >> v;
a[v].push_back(u);
}
int t, siz;
FOR(i, 1, q)
{
cin >> t >> siz;
FOR(j, 1, siz)
{
cin >> u;
y[i].pb(u);
}
cout << get(t, i) << "\n";
}
return 0;
}
