#include<cstdio>
#include<vector>
#include<bitset>
using namespace std;
vector <int> v[20005];
bitset <20005> A,B,viz;
int t,n,m,k,x,y,s,D[20005],P[20005],F[20005];
void dfs(int s)
{
    int i;
    viz[s]=1;
    for (i=0;i<v[s].size();++i)
    {
        if (!viz[v[s][i]])
            dfs(v[s][i]);
        if (!D[s] || D[s]>D[v[s][i]]+1)
            D[s]=D[v[s][i]]+1, F[s]=v[s][i];
    }
}
void afis()
{
    int i;
    for (i=1;i<=k;++i)
    {
        x=P[i];
        while (F[x])
        {
            printf("%d %d ",x,F[x]);
            x=F[x];
        }
    }
}
int main()
{
    int i,j;
    freopen("pioni.in","r",stdin);
    freopen("pioni.out","w",stdout);
    scanf("%d%d%d",&t,&n,&m);
    for (i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        B[x]=1, A[y]=1;
    }
    for (i=1;i<=n;++i)
        if (!A[i])
            dfs(i);
    for (i=0;i<t;++i)
    {
        s=0;
        for (j=1;j<=n;++j)
            P[j]=0;
        scanf("%d",&k);
        for (j=1;j<=k;++j)
        {
            scanf("%d",&P[j]);
            s+=D[P[j]];
        }
        if (s&1)
        {
            printf("Nargy\n%d ",s);
            afis();
            printf("\n");
        }
        else
            printf("Fumeanu\n");
    }
    return 0;
}