#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#ifdef DEB
#define D if(1)
#else 
#define D if(0)
#endif

const int NMAX = 312345;
struct Vr
{
	Vr * root;
	vector<Vr *> n;
	vector<Vr *> maly;
	bool is;
	void komp(Vr * r)
	{
		if(root) return;
		if(!is) return;
		root = r;
		for(Vr * it : n) it->komp(root);
	}
	void malykomp(Vr * r)
	{
		if(root) return;
		root = r;
		for(Vr * it : maly) it->malykomp(root);
	}
};
Vr vr [NMAX];

pair<Vr *,Vr *> hrany[NMAX];

int n,m,q;
Vr * ask[NMAX];
int main()
{
	scanf("%d%d%d",&n,&m,&q);
	for(int i=0;i<m;i++)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		a--;b--;
		vr[a].n.push_back(vr+b);
		vr[b].n.push_back(vr+a);
		hrany[2*i  ]={vr+a,vr+b};
		hrany[2*i+1]={vr+b,vr+a};
	}
	sort(hrany,hrany+2*m);
	for(int t=0;t<q;t++)
	{
		int p;
		scanf("%d",&p);
		for(int i=0;i<p;i++)
		{
			int tmp;
			scanf("%d",&tmp);
			tmp --;
			ask[i]=vr+tmp;
		}
		int out=0;
		if(p*p>100000)
		//if(0)
		{
			D printf("VELKY");
			for(int i=0;i<n;i++)
			{
				vr[i].is=0;
				vr[i].root=0;	
			}
			for(int i=0;i<p;i++)
			{
				ask[i]->is=1;
			}
			for(int i=0;i<n;i++)
			{
				if(vr[i].is&&vr[i].root==0)
				{
					out++;
					vr[i].komp(vr+i);
				}
			}
		}
		else
		{
			D printf("MALY");
			for(int i=0;i<p;i++)
			{
				ask[i]->maly.clear();
				ask[i]->root=0;
			}
			for(int i=0;i<p;i++)
				for(int j=i+1;j<p;j++)
				{

					pair<Vr *,Vr *> p =make_pair(ask[i],ask[j]);
					pair<Vr *,Vr *> f =
						*lower_bound(hrany,hrany+2*m,p);
					if(f==p)
					{
						ask[i]->maly.push_back(ask[j]);
						ask[j]->maly.push_back(ask[i]);
					}

				}
			for(int i=0;i<p;i++)
			{
				if(ask[i]->root==0)
				{
					out++;
					ask[i]->malykomp(ask[i]);
				}
			}
		}
		printf("%d\n",out);
	}
	return 0;
}