#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=2e5+9,inf=0x3f3f3f3f;
int vst[N],n,m,q,b,del[N],g[N];
vp f[N];
vi e[N];

signed main() {
  n=read(), m=read(), q=read(), b=min(n,300);
  rep(i,1,m) {
    int u=read(), v=read();
    e[v].eb(u);
  }
  rep(i,1,n) {
    vp tmp; f[i].eb(1,i);
    for(int j:e[i]) {
      tmp.resize(f[i].size()+f[j].size());
      merge(f[j].begin(),f[j].end(),
        f[i].begin(),f[i].end(),tmp.begin());
      f[i].clear(); int cnt=0;
      for(auto [w,v]:tmp) {
        if(cnt==b) break;
        if(vst[v]) continue; vst[v]=1;
        f[i].eb(w,v); ++cnt;
      }
      for(auto [w,v]:f[i]) vst[v]=0;
    }
    for(pii &p:f[i]) p.fi--;
  }
  rep(i,1,q) {
    int t=read(), y=read(), ans=-1; vi tmp;
    rep(j,1,y) tmp.eb(read());
    for(int x:tmp) del[x]=1;
    if(y<b) {
      for(auto [w,v]:f[t]) if(!del[v])
        ans=max(ans,-w);
    } else {
      rep(u,1,t) {
        g[u]=(del[u]?-inf:0);
        for(int v:e[u])
          g[u]=max(g[u],g[v]+1);
      }
      ans=max(ans,g[t]);
    }
    printf("%d\n",ans);
    for(int x:tmp) del[x]=0;
  }
  return 0;
}