Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Scan()
	num, _ := strconv.Atoi(sc.Text())
	nodes := make(map[int]*node)

	for i := 0; i < num; i++ {
		sc.Scan()
		id, _ := strconv.Atoi(sc.Text())
		sc.Scan()
		nodeNum, _ := strconv.Atoi(sc.Text())
		n := node{id, make([]int, 0), -1}
		for j := 0; j < nodeNum; j++ {
			sc.Scan()
			nid, _ := strconv.Atoi(sc.Text())
			n.nexts = append(n.nexts, nid)
		}
		nodes[id] = &n
	}
	nodes[1].depth = 0

	walk(1, 0, &nodes)
	for i := 1; i < len(nodes)+1; i++ {
		fmt.Printf("%v %v\n", (*nodes[i]).id, (*nodes[i]).depth)
	}
}

var time int
var record [100][100]bool
var q Queue

func walk(nid int, from int, nodes *map[int]*node) {
	q.Enqueue((*nodes)[nid])
	for !q.IsEmpty() {
		n := q.Dequeue().(*node)
		for _, v := range n.nexts {
			n2 := (*nodes)[v]
			if n2.depth != -1 {
				continue
			}
			n2.depth = n.depth + 1
			q.Enqueue((*nodes)[v])
		}
	}
}

type node struct {
	id    int
	nexts []int
	depth int
}

// Queue is Queue
type Queue struct {
	val []interface{}
}

// Enqueue value
func (queue *Queue) Enqueue(val interface{}) {
	queue.val = append(queue.val, val)
}

// Dequeue value
func (queue *Queue) Dequeue() interface{} {
	res := queue.val[0]
	queue.val = queue.val[1:len(queue.val)]
	return res
}

// IsEmpty return true when queue is empty
func (queue *Queue) IsEmpty() bool {
	return len(queue.val) == 0
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;

int main(void)
{
	// 頂点数と辺数
	int N;
	cin >> N;

	Graph G(N + 1);
	for (int i = 1; i <= N; i++)
	{
		int u, k, v;
		cin >> u >> k;
		for (int i = 0; i < k; i++)
		{
			cin >> v;
			G[u].push_back(v);
		}
	}

	// BFSのためのデータ構造
	vector<int> dist(N + 1, -1); // 全頂点を未訪問に初期化
	queue<int> que;

	// 初期条件
	dist[1] = 0;
	que.push(1); // 0を橙色頂点に

	// BFS開始
	while (!que.empty())
	{
		int v = que.front();
		que.pop();

		// vから辿れる頂点をすべて探索
		for (int nv : G[v])
		{
			if (dist[nv] != -1) continue; // 発見済みの頂点は探索しない

			//　新たな白色頂点 nv について距離情報を更新しキューに追加
			dist[nv] = dist[v] + 1;
			que.push(nv);
		}
	}

	// 結果出力 (各頂点の頂点 0 からの距離を見る)
	for (int v = 1; v <= N; ++v) cout << v << " " << dist[v] << endl;
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<array>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
static const int N=100;
static const int inf=(1<<29);
int M[N][N];
int d[N];
int n;

void dfs(int u){
    rep(i,n)d[i]=inf;
    
    queue<int> q;
    q.push(u);
    d[u]=0;
    int l;
    while(!q.empty()){
        l=q.front();
        q.pop();
        for(int v=0;v<n;v++){
            if(M[l][v]==0)continue;
            if(d[v]!=inf)continue;
            d[v]=d[l]+1;
            q.push(v);
        }
    }
    
    rep(i,n){
        cout<<i+1<<" "<<(d[i]==inf?-1:d[i])<<endl;
    }
    
    
}



int main(){
    int u,k,v;
    cin>>n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            M[i][j]=0;
        }
    }
    
    
    for(int i=0;i<n;i++){
        cin>>u>>k;
        u--;
        for(int j=0;j<k;j++){
            cin>>v;
            v--;
            M[u][v]=1;
        }
    }
    dfs(0);
    
}

C++: #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
using namespace std;
using ll = long long;
const int INF = +100100100;
// typedef pair<int,int> P;

vector<int> D(150, INF);
vector<vector<int>> M(150, vector<int>(150));
int n;

void bfs()
{
    int s = 0;
    queue<int> Q;
    Q.push(s);
    D[0]=0;
    while (!Q.empty())
    {
        int u = Q.front();
        Q.pop();
        rep(v, n)
        {
            // 訪れたことがない
            if (D[v] == INF&&M[u][v]==1)
            {
                D[v] = D[u] + 1;
                Q.push(v);
            }
        }
    }
    rep(i,n)if(D[i]==INF)D[i]=-1;
}

int main()
{
    cin >> n;
    vector<list<int>> L(n);
    rep(i, n)
    {
        int u, e;
        cin >> u >> e;
        rep(j, e)
        {
            int v;
            cin >> v;
            --v;
            L[i].push_back(v);
        }
    }
    
    rep(i, n)
    {
        rep(j, n)
        {
            list<int>::iterator it = find(L[i].begin(), L[i].end(), j);
            if (it != L[i].end())
            {
                M[i][j] = 1;
                L[i].erase(it);
            }
        }
    }
    bfs();
    rep(i,n){
        printf("%d %d\n",i+1,D[i]);
    }
    return 0;
}

C++: #include<iostream>
#include<queue>

using namespace std;
static const int N = 100;
static const int INFTY = (1<<21);

int n,M[N][N];
int d[N];

void bfs(int s){
  queue<int> q;
  q.push(s);
  for(int i = 0; i < n; i++) d[i] = INFTY;
  d[s] = 0;
  int u;
  while(!q.empty()){
    u = q.front();
    q.pop();
    for(int v=0;v<n;v++){
      if(M[u][v] == 0) continue;
      if(d[v]!=INFTY) continue;
      d[v] = d[u] + 1;
      q.push(v);
    }
  }
  for(int i = 0; i<n; i++){
    cout << i+1; << " " << ( (d[i] == INFTY) ? (-1) : d[i] ) << endl;
  }
}

int main(){
  int u,k,v;

  cin >> n;
  for(int i=0;i<n;i++){
    for(int j = 0; j < n; j++) M[i][j] = 0;
  }

  for(int i = 0; i < n; i++){
    cin >> u >> k;
    u--;
    for(int j = 0; j<k; j++){
      cin>>v;
      v--;
      M[u][v] = 1;
    }
  }
  bfs(0);

  return 0;
}

C++: #include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>

#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert

using namespace std;

//-------------------------------------------------
//--Graph Template
//-------------------------------------------------
template<class E>
struct Graph
{
    vector<vector<E> > adj;
    Graph(int N):adj(N){}
    virtual void add_edge(int v, E e){adj[v].push_back(e);}
    vector<E>& operator[](int v){return adj[v];}
    inline int size(){return adj.size();}
};

struct NormalEdge {
    int to;
    NormalEdge(int to):to(to){}
};

struct UWGraph : public Graph<NormalEdge>
{
    UWGraph(int N):Graph(N){}
    void add_edge(int v, int e){adj[v].push_back({e});}
};

//-------------------------------------------------
//--Dist BFS
//-------------------------------------------------
template<class E>
vector<int> distBFS(Graph<E> &G, int s)
{
    vector<int> dist(G.size(),-1); dist[s]=0;
    queue<int> que; que.push(s);
    while(!que.empty()){
        int v = que.front(); que.pop();
        for(auto e:G[v]){
            if (dist[e.to]!=-1) continue;
            dist[e.to]=dist[v]+1;
            que.push(e.to);
        }
    }
    return dist;
}

//-------------------------------------------------

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N; cin>>N;
    UWGraph G(N);
    rep(i,N){
        int u,k; cin>>u>>k; u--;
        rep(i,k){
            int v; cin>>v; v--;
            G.add_edge(u,v);
        }
    }
    auto dist = distBFS(G,0);
    rep(i,N){
        cout<<i+1<<" "<<dist[i]<<"\n";
    }
    return 0;
}