#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#define M 4
#define N 100000
#define K 200
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int num,data;
};
int n,m,qs,cater,lg[N+1],A[N+1],B[N+1],fas[N+1],L[N+1],R[N+1],sfa[N+1],fa[N+1][21],a[N+1],tong[N+1],length,depth[N+1],dque[N+1],top,dfn[N+1],ps[N+1],sL[K+1],sR[K+1],sz[N+1],leng,in[N+1];
__int128 dp[M+1][N+1];
bool used[N+1],vis[N+1],vst[N+1],EZ[K+1][K+1],usedt[K+1][K+1];
vector<reads>v[N+1];
vector<int>E[N+1];
vector<int>ES[N+1];
vector<int>ET[N+1];
void add(int x,int y)
{
	E[x].push_back(y),in[y]++;
	return;
}
void dfs(int x)
{
	dfn[x]=++leng,sz[x]=1;
	for (int i=0;i<ES[x].size();++i)
		if (!dfn[ES[x][i]])
			dfs(ES[x][i]),sz[x]+=sz[ES[x][i]];
	return;
}
bool LENG(int x,int y)
{
	return dfn[x]<=dfn[y]&&dfn[y]<=dfn[x]+sz[x]-1;
}
void dfs4(int x)
{
	used[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			fas[E[x][i]]=x,dfs4(E[x][i]);
	return;
}
void dfs5(int x)
{
	int scnt=0;
	used[x]=1,vst[x]=vis[x];
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			dfs5(E[x][i]),vst[x]|=vst[E[x][i]],scnt+=vst[E[x][i]];
	if (scnt>=2) vis[x]=1;
	if (vis[x]) A[x]=B[x]=++cater;
	return;
}
void dfs6(int x)
{
	used[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
		{
			if (!A[E[x][i]]) A[E[x][i]]|=A[x];
			dfs6(E[x][i]);
			if (!B[x]) B[x]|=B[E[x][i]];
		}
	return;
}
void dfs7(int x,int y)
{
	usedt[x][y]=1;
	for (int i=1;i<=cater;++i)
		if (EZ[y][i]&&!usedt[x][i])
			dfs7(x,i);
	return;
}
int lca(int x,int y)
{
	if (depth[x]<depth[y]) swap(x,y);
	for (int i=lg[n];i>=0;--i)
		if (depth[fa[x][i]]>=depth[y])
			x=fa[x][i];
	if (x==y) return x;
	for (int i=lg[n];i>=0;--i)
		if (fa[x][i]!=fa[y][i])
			x=fa[x][i],y=fa[y][i];
	return fa[x][0];
}
void topo_sort()
{
	int top;
	queue<int>q;
	q.push(1),depth[1]=1;
	while (!q.empty())
	{
		top=q.front(),q.pop(),tong[++length]=top;
		if (top!=1)
		{
			fa[top][0]=ps[top],depth[top]=depth[ps[top]]+1;
			for (int i=1;i<=lg[n];++i) fa[top][i]=fa[fa[top][i-1]][i-1];
		}
		for (int i=0;i<E[top].size();++i)
		{
			ps[E[top][i]]=ps[E[top][i]]?lca(ps[E[top][i]],top):top,in[E[top][i]]--;
			if (!in[E[top][i]]) q.push(E[top][i]);
		}
	}
	for (int i=1;i<=n;++i)
		if (ps[i])
			ES[ps[i]].push_back(i);
	return;
}
bool check(int x,int tl,int tr)
{
	if (!B[x]) return 1;
	return tl<=sL[B[x]]&&sR[B[x]]<=tr;
}
void dfs2(int x)
{
	int d=x;
	for (int i=0;i<ET[x].size();++i) sfa[ET[x][i]]=x,dfs2(ET[x][i]),L[x]=min(L[x],L[ET[x][i]]),R[x]=max(R[x],R[ET[x][i]]);
	if (check(d,L[x],R[x]))
	{
		for (int i=lg[n];i>=0;--i)
			if (depth[fa[d][i]]>depth[sfa[x]]&&check(fa[d][i],L[x],R[x]))
				d=fa[d][i];
		v[R[x]].push_back((reads){L[x],depth[x]-depth[d]+1});
	}
	return;
}
void dfs3(int x)
{
	for (int i=0;i<ET[x].size();++i) dfs3(ET[x][i]);
	L[x]=n+1,R[x]=0,ET[x].clear();
	return;
}
void write(__int128 x)
{
	if (x<=9)
	{
		printf("%d",(int)(x));
		return;
	}
	write(x/10),printf("%d",(int)(x%10));
	return;
}
bool cmp(int x,int y)
{
	return dfn[x]<dfn[y];
}
int main()
{
	int k,p,x,y,d,ds;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	n=read(),m=read(),qs=read();
	for (int i=1;i<=m;++i) x=read(),y=read(),add(x,y);
	topo_sort(),dfs(1),dfs4(1);
	for (int i=1;i<=n;++i)
	{
		used[i]=0;
		for (int j=0;j<E[i].size();++j)
			if (fas[E[i][j]]!=i)
				vis[i]=vis[E[i][j]]=1;
	}
	dfs5(1);
	for (int i=1;i<=n;++i) used[i]=0;
	dfs6(1);
	for (int i=1;i<=n;++i) L[i]=n+1,R[i]=0,sL[i]=n+1,sR[i]=0;
	for (int i=2;i<=n;++i)
		if (A[fas[i]]&&B[i])
			EZ[A[fas[i]]][B[i]]=1;
	for (int i=1;i<=n;++i)
		for (int j=0;j<E[i].size();++j)
			if (fas[E[i][j]]!=i)
				EZ[A[i]][A[E[i][j]]]=1;
	for (int i=1;i<=cater;++i) dfs7(i,i);
	for (int qt=1;qt<=qs;++qt)
	{
		k=read(),p=read(),top=length=0;
		for (int i=1;i<=cater;++i) sL[i]=p+1,sR[i]=0;
		for (int i=1;i<=p;++i) a[i]=read();
		sort(a+1,a+p+1,cmp);
		for (int i=1;i<=p;++i)
		{
			L[a[i]]=R[a[i]]=i,v[i].clear();
			for (int j=1;j<=cater;++j)
				if (usedt[j][A[a[i]]])
					sL[j]=min(sL[j],i),sR[j]=max(sR[j],i);
		}
		for (int i=1;i<=p;++i)
		{
			d=0;
			while (top&&!LENG(dque[top],a[i]))
			{
				if (d) ET[dque[top]].push_back(d);
				d=dque[top],top--;
			}
			if (d)
			{
				ds=lca(d,a[i]),ET[ds].push_back(d);
				if (dque[top]!=ds) dque[++top]=ds;
			}
			dque[++top]=a[i];
		}
		for (int i=1;i<=top-1;++i) ET[dque[i]].push_back(dque[i+1]);
		sfa[dque[1]]=0,dfs2(dque[1]);
		for (int i=0;i<=k;++i)
			for (int j=0;j<=p;++j)
				dp[i][j]=0;
		dp[0][0]=1;
		for (int i=1;i<=k;++i)
			for (int j=1;j<=p;++j)
				for (int t=0;t<v[j].size();++t)
					dp[i][j]+=dp[i-1][v[j][t].num-1]*v[j][t].data;
		write(dp[k][p]),puts(""),dfs3(dque[1]);
	}
	return 0;
}