#include <bits/stdc++.h>
#define rep(i,a,b) for (int i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define debug printf
using namespace std;
typedef pair <int, int> PII;
typedef vector <int> VI;
typedef long long ll;
typedef long double ld;

const int N = 1e5 + 10;
const int sqrtn = 100;
int deg[N];
vector<int> v[N];
vector<int> bigV[N];
int f[N];
vector<int> xs;
bool is[N];
bool visF[N];

int find(int a){
//cout<<a<<" "<<f[a]<<endl;
	if(f[a] == a) return a;
	f[a] = find(f[a]);
	return f[a];
}

void un(int a, int b){
	a = find(a); b = find(b);
	f[b] = a;
}

int main ()
{
	ios_base::sync_with_stdio(false);
	int a,b,n,m,q; cin>>n>>m>>q;
	vector<PII> E;
	for(int i=1;i<=n;i++) f[i] = i;
	for(int i=0;i<m;i++){
		cin>>a>>b;
		E.pb(mp(a,b));
		deg[a] ++; deg[b]++;
	}
	for(auto P:E){
		a = P.fi; b = P.se;
		if(deg[a] > sqrtn && deg[b] > sqrtn){
			bigV[a].pb(b);
			bigV[b].pb(a);			
		}
		else{
			v[a].pb(b);
			v[b].pb(a);
		}
	}
	while(q--){
		cin>>n;
		xs.resize(0);
		for(int i=0;i<n;i++){
			cin>>a;
			xs.pb(a);
			is[a] = true;
		}
		for(auto x:xs){
			if(deg[x] <= sqrtn){
				for(auto u:v[x]) if(is[u]) un(x,u);
			}
			else
				for(auto u:bigV[x]) if(is[u]) un(x,u);
		}
		int ans = n;
		for(auto x:xs){
			if(!visF[find(x)]) visF[find(x)] = true;
			else ans--;
		}
		cout<<ans<<"\n";
		for(auto x:xs){
			f[x] = x;
			is[x] = false;
			visF[x] = false;
		}
	}	
	
}