Go: package main

/*
グラフの表現 隣接行列による表現
*/

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

func main() {
	scanner := makeScanner(8192)
	n := eGetInt(scanner)
	g := make([][]int, n+1)
	for i := 1; i < n+1; i++ {
		g[i] = make([]int, n+1)
		ints := eGetInts(scanner)
		num := ints[0]
		for j := 0; j < ints[1]; j++ {
			g[num][ints[j+2]] = 1
		}
	}
	dist := make([]int, n+1)
	for i := 0; i < len(dist); i++ {
		dist[i] = -1
	}
	q := []int{}

	// 訪問する
	q = append(q, 1)
	dist[1] = 0

	// キューが空でない限り
	for len(q) > 0 {
		// 先頭を取り出す
		top := 0
		top, q = q[0], q[1:]
		// 隣接マスを入れる.
		for i := 1; i < n+1; i++ {
			// 辺がある
			if g[top][i] == 1 {
				if dist[i] == -1 {
					// 訪問済みでなければ
					q = append(q, i)
					dist[i] = dist[top] + 1
				}
			}
		}
	}
	for i := 1; i < n+1; i++ {
		fmt.Println(i, dist[i])
	}
}

////////////////////////////////////////////////////////////////////////////////
// ライブラリ
////////////////////////////////////////////////////////////////////////////////
func makeScanner(maxByte int) *bufio.Scanner {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Buffer(make([]uint8, 0, 8192), maxByte)
	return scanner
}
func makeWordScanner() *bufio.Scanner {
	scanner := makeScanner(8192)
	scanner.Split(bufio.ScanWords)
	return scanner
}
func eGetLine(r *bufio.Scanner) string {
	if r.Scan() {
		return r.Text()
	}
	err := r.Err()
	if err != nil {
		log.Fatal(err)
	}
	// EOF
	return ""
}
func eGetInt(r *bufio.Scanner) int {
	line := eGetLine(r)
	return eAtoi(line)
}
func eGetInt64(r *bufio.Scanner) int64 {
	line := eGetLine(r)
	return eAtoInt64(line)
}
func eGetFields(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Fields(line)
}
func eGetInts(r *bufio.Scanner) []int {
	fields := eGetFields(r)
	ints := make([]int, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoi(fields[i])
	}
	return ints
}
func eGetInt64s(r *bufio.Scanner) []int64 {
	fields := eGetFields(r)
	ints := make([]int64, len(fields))
	for i := 0; i < len(ints); i++ {
		ints[i] = eAtoInt64(fields[i])
	}
	return ints
}
func eGetChars(r *bufio.Scanner) []string {
	line := eGetLine(r)
	return strings.Split(line, "")
}
func eAtoi(s string) int {
	n, err := strconv.Atoi(s)
	if err != nil {
		log.Fatal(err)
	}
	return n
}
func eAtoInt64(s string) int64 {
	n, err := strconv.ParseInt(s, 10, 64)
	if err != nil {
		log.Fatal(err)
	}
	return n
}

C++: #include <bits/stdc++.h>
using namespace std;

/*

void bfs(int vertex, int depth)
{
  seen[vertex] = true;
  ans [vertex] = depth;
  for (auto &&i : G[vertex]) que.push(i);
  while(!(que.empty()))
  {
    int next = que.front();
    que.pop();
    if (seen[next] == false)
    {
      bfs(next,depth + 1);
    }
  }

  
}




int main()
{
  fill_n(ans,105,-1);
  fill_n(seen,105,false);
  int n;cin>>n;
  for (int i = 0; i < n; i++)
  {
    int u;cin>>u;
    int k;cin>>k;
    for (int j = 0; j < k; j++)
    {
      int v;cin>>v;
      G[u].push_back(v);
    }
    
  }

}
*/



  
int ans[105];
vector<int> G[105];
queue<int> que;

int main()
{
  fill_n(ans,105,-1);
  int n;cin>>n;
  for (int i = 0; i < n; i++)
  {
    int u;cin>>u;
    int k;cin>>k;
    for (int j = 0; j < k; j++)
    {
      int v;cin>>v;
      G[u].push_back(v);
    }
    
  }


/*
  for (int i = 1; i <= n; i++)
  {
    cout << i << ": " ;
    for (auto &&j : G[i])
    {
      cout << j << " ";
    }
    cout << endl;
    
  }
*/


  que.push(1);
  ans[1] = 0;

  while (!que.empty())
  {
    int vertex = que.front();
    que.pop();

    for (auto &&next : G[vertex])
    {
      if (ans[next] != -1) continue;
      que.push(next);
      ans[next] = ans[vertex] + 1;
    }
  

  }
  

  for (int i = 1; i <= n; i++)
  {
    cout << i << " " << ans[i] << endl;
  }
  

}

C++: // -*- mode:c++; coding:utf-8; c-basic-offset:2; -*-
// ALDS1_11_C: Breadth First Search

#include <algorithm>
#include <cstdio>
#include <queue>

using uint = unsigned int;

class Graph {
  const uint n_;
  uint* const g_;
  int* const depth_;
  
public:
  Graph(uint n) : n_(n),
                  g_(new uint[(n_*n_)]),
                  depth_(new int[n])
  {
    std::fill(g_, g_+(n_*n_), 0u);
  }

  ~Graph()
  {
    delete[] g_;
    delete[] depth_;
  }
  
  uint* operator [](uint i) const { return g_+(n_*i); }

  int* depth() const { return depth_; }

  void bfs()
  {
    init_depth();
    std::queue<uint> q;
    auto i = 0u;
    q.push(i);
    depth_[i] = 0;
    while (!q.empty()) {
      i = q.front();
      for (auto j = 0u; j < n_; ++j) {
        if ((*this)[i][j] && depth_[j] == -1) {
          q.push(j);
          depth_[j] = depth_[i]+1;
        }
      }
      q.pop();
    }
  }

private:
  void init_depth()
  {
    std::fill(depth_, depth_+(n_), -1);
  }
};

int main()
{
  uint n;
  std::scanf("%u", &n);

  Graph g(n);

  uint u, k, v;
  for (auto i = 0u; i < n; ++i) {
    std::scanf("%u %u", &u, &k);
    for (auto j = 0u; j < k; ++j) {
      std::scanf("%u", &v);
      g[u-1][v-1] = 1;
    }
  }

  g.bfs();
  auto depth = g.depth();
  for (auto i = 0u; i < n; ++i) {
    std::printf("%u %d\n", i+1, depth[i]);
  }
}

// eof

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

using namespace std;

static const int N = 100;

int n,d[N],M[N][N];//d[]...?§??????????????????¢(-1?????°?????????)???M[][]?????£??\???????????§????????????

void dfs(int r) {
	queue<int> q;//queue??§?????????
	q.push(r);//?§?????????£??\
	for (int i = 0; i < n; i++) d[i] = -1;//??????????????????
	d[r] = 0;//?§????????????¢???0

	int u;
	while (!q.empty()) {//??¢?´¢???????????§??°?????????
		u = q.front();//u????????\?????????????????¢?´¢???????????£?????????????????£??\
		q.pop();//?????\???????????????????´????????????????

		for (int v = 0; v < n; v++) {//??£??\????????????????????????
			if (M[u][v] == 0) continue;//?§??????¨??????????????§?????°?????????????????´???????????????
			if (d[v] != -1) continue;//?§??????¨????????¢???????????£??????????????¢?´¢???????????£??????????????´??????????????????
			d[v] = d[u] + 1;//??????u????§??????¨??£??\?????????????????????????????¢1???1?????????????????????????????????+1???
			q.push(v);//?????\??????v?????????
		}
	}
	for (int i = 0; i < n; i++) {
		cout<<i+1<<" "<<d[i]<<endl;//??????
	}
}

int main() {
	int u, p, v;
	cin >> n;
	for (int i = 0; i < n; i++) {//?????????(d[]?????¢????????????dfs??§?±??????????????????§????????????????????????)
		for (int j = 0; j < n; j++) {
			M[i][j] = 0;
		}
	}

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

	dfs(0);//??????0????§??????¨??????

	return 0;
}