#include <bits/stdc++.h>

using namespace std;

ifstream in ("pioni.in");
ofstream out("pioni.out");
const int N = 20005;
vector<int> v[N];
bool dp[N],viz[N],a[N];
int nxt[N],query[N];
void dfs (int x)
{
    viz[x] = 1;
    for (auto it: v[x])
    {
        if (!viz[it])
            dfs(it);
        if (!dp[it] && !dp[x])
        {
            dp[x] = 1;
            nxt[x] = it;
        }
    }
}
int main()
{
    int t,n,m;
    in >> t >> n >> m;
    for (int i = 1; i<=m; i++)
    {
        int x,y;
        in >> x >> y;
        v[x].push_back(y);
    }
    for (int i = 1; i<=n; i++)
        if (!viz[i])
            dfs(i);
    for (int i = 1; i<=t; i++)
    {
        int k,cnt=0;
        in >> k;
        for (int j = 1; j<=k; j++)
        {
            in >> query[j];
            cnt+=dp[query[j]];
        }
        if (cnt>0)
        {
            out << "Nargy\n" << cnt << " ";
            for (int j = 1; j<=k; j++)
                if (dp[query[j]])
                    out << query[j] << " " << nxt[query[j]] << " ";
            out << "\n";
        }
        else
            out << "Fumeanu\n";
    }
}