1148.cpp

/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define inf       HUGE_VAL
#define mem(a, b) memset(a, b, sizeof(a))
#define NN        100000
vector<int> edge[NN + 7];
int dist[NN + 7];
queue<int> q;
int dr[] = {0, -1, 0, 1};
int dc[] = {-1, 0, 1, 0};
int R, C;
int bfs(int src, int dst) {
    q = queue<int>();
    mem(dist, -1);
    q.push(src);
    dist[src] = 0;
    while (!q.empty()) {
        int k = q.front();
        q.pop();
        for (int i = 0; i < edge[k].size(); i++) {
            if (dist[edge[k][i]] == -1) {
                q.push(edge[k][i]);
                dist[edge[k][i]] = dist[k] + 1;
                if (edge[k][i] == dst) return dist[k];
            }
        }
    }
    return 0;
}

int main() {
    // freopen("C:\\Users\\Maruf Tuhin\\Desktop\\in.txt","r",stdin);
    int i, j, k, l, n, r, c;
    int tc, t = 1;
    scanf("%d", &tc);
    while (tc--) {
        scanf("%d", &n);
        for (i = 0; i < n; i++) {
            scanf("%d%d", &r, &k);
            while (k--) scanf("%d", &c), edge[r].push_back(c), edge[c].push_back(r);
        }
        scanf("%d%d", &k, &l);
        int sum = bfs(k, l);
        if (t != 1) puts("");
        printf("%d %d %d\n", k, l, sum);
        t++;
        for (i = 0; i <= n; i++) edge[i].clear();
    }
    return 0;
}