#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

const int nMax = 20005;

bool viz[nMax];
vector<int> vecini[nMax];
bool win[nMax];
int mutare[nMax];

void DFS(int current)
{
    viz[current] = true;
    for(auto v:vecini[current])
    {
        if(viz[v] == false)
            DFS(v);
        if(win[v] == false)
        {
            win[current] = true;
            mutare[current] = v;
        }
    }
}

int main()
{
    ifstream in("pioni.in");
    ofstream out("pioni.out");
    int t, n, m;
    in >> t >> n >> m;
    int x, y;
    while(m--)
    {
        in >> x >> y;
        vecini[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        if(viz[i] == false)
            DFS(i);
    while(t--)
    {
        int k, x;
        in >> k;
        vector<int> rasp;
        while(k--)
        {
            in >> x;
            if(win[x])
                rasp.push_back(x);
        }
        if(rasp.empty())
            out << "Fumeanu\n";
        else
        {
            out << "Nargy\n" << rasp.size() << " ";
            for(auto x:rasp)
                out << x << " " << mutare[x] << " ";
            out << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}