#include<cstdio>
#include<vector>
using namespace std;
vector<int> v[20010];
int vc[20010],p[30010],sol[30010];
void dfs(int nod){
    int x=v[nod].size(),i;
    if(x==0){
        vc[nod]=-1;
        return;
    }
    for(i=0;i<x;i++)
        if(vc[v[nod][i]]==0)
            dfs(v[nod][i]);
    for(i=0;i<x;i++)
        if(vc[v[nod][i]]==-1){
            vc[nod]=1;
            return;
        }
    vc[nod]=-1;
}
int main(){
    freopen("pioni.in","r",stdin);
    freopen("pioni.out","w",stdout);
    int t,n,m,q,a,b,i,j,k;
    scanf("%d%d%d",&t,&n,&m);
    for(i=1;i<=m;i++){
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        if(vc[i]==0)
            dfs(i);
    for(q=1;q<=t;q++){
        scanf("%d",&k);
        for(i=1;i<=k;i++)
            scanf("%d",&p[i]);
        sol[0]=0;
        for(i=1;i<=k;i++)
            if(vc[p[i]]==1){
                sol[0]++;
                sol[sol[0]]=p[i];
            }
        if(sol[0]==0)
            printf("Fumeanu\n");
        else{
            printf("Nargy\n%d ",sol[0]);
            for(i=1;i<=sol[0];i++){
                printf("%d ",sol[i]);
                j=0;
                while(vc[v[sol[i]][j]]!=-1)
                    j++;
                printf("%d",v[sol[i]][j]);
                if(i==sol[0])
                    printf("\n");
                else
                    printf(" ");
            }
        }
    }
    return 0;
}