#include <cstdio>
#include <vector>
#define MAXN 20050

using namespace std;

vector <int> graf[MAXN];
int t, n, m, k, status[MAXN], nxt[MAXN];

void build(int nod)
{
    if (status[nod]) return;
    status[nod] = 2;
    for (int y : graf[nod]) {
        build(y);
        if (status[y] == 2) {
            status[nod] = 1;
            nxt[nod] = y;
        }
    }
}

int main()
{
    freopen("pioni.in", "r", stdin);
    freopen("pioni.out", "w", stdout);

    scanf("%d %d %d", &t, &n, &m);
    for (int i = 1; i <= m; i++) {
        int x, y;
        scanf("%d %d", &x, &y);
        graf[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        build(i);
    while (t--) {
        scanf("%d", &k);
        vector<pair<int, int> > sol;
        for (int i = 1; i <= k; i++) {
            int x;
            scanf("%d", &x);
            if (status[x] == 1)
                sol.push_back(make_pair(x, nxt[x]));
        }
        if (sol.size()) {
            printf("Nargy\n");
            printf("%d ", sol.size());
            for (pair<int, int> p : sol)
                printf("%d %d ", p.first, p.second);
            printf("\n");
        }
        else
            printf("Fumeanu\n");
    }

    return 0;
}