#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define LD long double
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define SIZ(c) (int)(c).size()
#define ALL(c) (c).begin(), (c).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define FORD(i, b, e) for (int i = (b); i >= (int)(e); i--)
#define ll LL
#define st f
#define nd s
#define mp MP
#define pb PB
#define eb emplace_back
#define siz(c) SIZ(c)
const int inf = 1e9 + 7;
const LL INF = 1e18L + 7;

#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type
{int o = 0; p << "{"; for (auto c : y) {if (o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << "\n";}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if (p > y) p = y;}
sim, class s> void maxi(n &p, s y) {if (p < y) p = y;}

#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif

#define I(x) #x " =", (x), " "
const int M = 1024 * 128;


int n, m, q, T[M], S[M], tim[M];
VI V[M], V2[M];

int find(int a)
{
	if (T[a] == a)
	{
		return a;
	}
	return T[a] = find(T[a]);
}

void onion(int a, int b)
{
	T[find(a)] = find(b);
}

int32_t main()
{
	scanf("%d%d%d", &n, &m, &q);
	FOR(i, 1, m)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		V[a].PB(b);
		V[b].PB(a);
	}
	VPII X;
	FOR(i, 1, n)
	{
		X.PB(MP(SIZ(V[i]), i));
	}
	sort(ALL(X));
	FOR(i, 0, n - 1)
	{
		S[X[i].s] = i;
	}
	FOR(i, 1, n)
	{
		for (auto x : V[i])
		{
			if (S[i] < S[x])
			{
				V2[i].PB(x);
			}
		}
	}
	FOR(i, 1, q)
	{
		VPII XX;
		int l;
		scanf("%d", &l);
		FOR(j, 1, l)
		{
			int a;
			scanf("%d", &a);
			XX.PB(MP(SIZ(V[a]), a));
			T[a] = a;
			tim[a] = i;
		}
		sort(ALL(XX));
		int r = l;
		for (auto x : XX)
		{
			for (auto y : V2[x.s])
			{
				if (tim[y] != i)
				{
					continue;
				}
				if (find(x.s) != find(y))
				{
					r--;
					onion(x.s, y);
				}
			}
		}
		printf("%d\n", r);
	}
}