#include <cstdio>
#include <vector>
using namespace std;
vector<int> g[20005];
vector<int> win;
vector<int> sol;
bool viz[20005];
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0; i<g[nod].size(); i++){
        if(viz[g[nod][i]]==0)
            dfs(g[nod][i]);
        if(win[g[nod][i]]==0)
            win[nod]=g[nod][i];
    }
}
int main()
{   freopen("pioni.in", "r", stdin);
    freopen("pioni.out", "w", stdout);
    int t,n,m,x,y,k,i;
    scanf("%d%d%d", &t, &n, &m);
    for(i=1; i<=m; i++){
        scanf("%d%d", &x, &y);
        g[x].push_back(y);
    }
    win.resize(n+1, 0);
    for(i=1; i<=n; i++)
        if(viz[i]==0)
            dfs(i);
    while(t){
        scanf("%d", &k);
        sol.clear();
        for(i=1; i<=k; i++){
            scanf("%d", &x);
            if(win[x])
                sol.push_back(x);
        }
        if(sol.size()==0)
            printf("Fumeanu\n");
        else{
            printf("Nargy\n%d ", sol.size());
            for(i=0; i<sol.size(); i++)
                printf("%d %d ", sol[i], win[sol[i]]);
            printf("\n");
        }
        t--;
    }
    return 0;
}