#include<bits/stdc++.h>
#define ll long long
#define re register
#define gc get_char
#define cs const

namespace IO{
	inline char get_char(){
		static cs int Rlen=1<<22|1;
		static char buf[Rlen],*p1,*p2;
		return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++; 
	}
	
	template<typename T>
	inline T get(){
		char c;
		while(!isdigit(c=gc()));T num=c^48;
		while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
		return num;
	}
	inline int getint(){return get<int>();}
}
using namespace IO;

using std::cerr;
using std::cout;

cs int N=1e3+3;

int n,m,q;

std::vector<int> G[N];
inline void addedge(int u,int v){
	G[u].push_back(v);
	G[v].push_back(u);
}

int dist[N];
std::bitset<N> f[N][N];

inline void BFS(int S){
	static int q[N],qn;
	memset(dist+1,0x3f,sizeof(int)*n);
	dist[S]=0;q[qn=1]=S;
	for(int re i=1;i<=qn;++i){
		int u=q[i];
		for(int re v:G[u])if(dist[v]>n){
			dist[v]=dist[u]+1;
			q[++qn]=v;
		}
	}
	for(int re i=1;i<=n;++i)if(dist[i]<n)f[S][dist[i]].set(i);
	for(int re i=1;i<n;++i)f[S][i]|=f[S][i-1];
}

signed main(){
#ifdef zxyoi
	freopen("I'm back.in","r",stdin);
#endif
	n=getint(),m=getint(),q=getint();
	while(m--)addedge(getint(),getint());
	for(int re i=1;i<=n;++i)BFS(i);
	while(q--){
		int a=getint();
		std::bitset<N> state=0;
		while(a--){
			int x=getint(),y=getint();
			y=std::min(y,n-1);
			state|=f[x][y];
		}
		cout<<state.count()<<"\n";
	}
	return 0;
}