#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>

#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline int nextnum(){
    int a=0;
    char c=nextch();
    while(c<'0' || c>'9')
        c=nextch();
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a;
}

std::vector <int> G[20001];
int vic[20001], next[20001];

int Vic(int nod){
    if(vic[nod]==0){
        vic[nod]=2;
        for(int i=0;i<G[nod].size();i++)
            if(Vic(G[nod][i])==2){
                vic[nod]=1;
                next[nod]=G[nod][i];
            }
    }
    return vic[nod];
}

int main(){
    int t, n, m;
    FILE*fo;
    fi=fopen("pioni.in","r");
    fo=fopen("pioni.out","w");
    t=nextnum();
    n=nextnum();
    m=nextnum();
    for(int i=0;i<m;i++){
        int a=nextnum(), b=nextnum();
        G[a].push_back(b);
    }
    for(int i=1;i<=t;i++){
        int k=nextnum();
        int v[30000];
        int w=0;
        for(int j=0;j<k;j++){
            v[j]=nextnum();
            if(Vic(v[j])==1)
                w++;
        }
        if(w==0)
            fprintf(fo,"Fumeanu\n");
        else{
            fprintf(fo,"Nargy\n%d ", w);
            for(int j=0;j<k;j++)
                if(Vic(v[j])==1)
                    fprintf(fo,"%d %d ", v[j], next[v[j]]);
            fprintf(fo,"\n");
        }
    }
    fclose(fi);
    fclose(fo);
    return 0;
}