Go: package main

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

type vertexId int

type vertex struct {
	id vertexId
	visitedAt int
	adjs []vertexId
}

func createVertex(id int, adjsInt []int) vertex {
	adjs := make([]vertexId, len(adjsInt))
	for i := 0; i < len(adjs); i++ {
		adjs[i] = vertexId(adjsInt[i])
	}
	return vertex{
		id: vertexId(id),
		visitedAt: -1,
		adjs: adjs,
	}
}

func (v *vertex) isVisited() bool {
	return v.visitedAt >= 0
}

func bfs(id vertexId, vqueue []vertexId, vertices []vertex) {
	vertex := &vertices[id-1]
	for _, vid := range vertex.adjs {
		if !vertices[vid-1].isVisited() {
			(&vertices[vid-1]).visitedAt = vertex.visitedAt+1
			vqueue = append(vqueue, vid)
		}
	}
	if len(vqueue) > 0 {
		nextId := vqueue[0]
		nextVqueue := vqueue[1:]
		bfs(nextId, nextVqueue, vertices)
	}
}

func solveBfs(vertices []vertex) {
	vertex := &vertices[0]
	vertex.visitedAt = 0
	vqueue := make([]vertexId, 0)
	bfs(vertex.id, vqueue, vertices)
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	vertices := make([]vertex, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		adjN, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		adjs := make([]int, adjN)
		for j := 0; j < adjN; j++ {
			adjId, err := nextInt(sc)
			if err != nil {
				panic(err)
			}
			adjs[j] = adjId
		}
		vertices[i] = createVertex(id, adjs)
	}

	solveBfs(vertices)

	for i := 0; i < n; i++ {
		fmt.Printf("%d %d\n", vertices[i].id, vertices[i].visitedAt)
	}
}

func nextText(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

func nextInt(sc *bufio.Scanner) (int, error) {
	return strconv.Atoi(nextText(sc))
}

C++: #include <iostream>
#include <algorithm>
#include <queue>
#define MAX_V 101
#define INF 10000000
using namespace std;

bool edge[MAX_V][MAX_V];
int dist[MAX_V];

void bfs(int start, int n) {
  queue<int> que;
  que.push(start);
  dist[start] = 0;
  int current;
  while (!que.empty()) {
    current = que.front();
    que.pop();
    for (int i = 1; i <= n; i++) {
      if (edge[current][i] && dist[i] == INF) {
	dist[i] = dist[current] + 1;
	que.push(i);
      }
    }
  }
}

int main() {
  int n;
  cin >> n;

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      edge[i][j] = false;
    }
  }
  for (int j = 0; j < n; j++) {
    int u, k;
    cin >> u >> k;
    for (int i = 0; i < k; i++) {
      int v;
      cin >> v;
      edge[u][v] = true;
    }
  }

  for (int i = 1; i <= n; i++) {
    dist[i] = INF;
  }

  bfs(1, n);

  for (int i = 1; i <= n; i++) {
    cout << i << ' ';
    if (dist[i] == INF) cout << -1 << endl;
    else cout << dist[i] << endl;
  }
}

C++: #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main()
{
    int n; cin >> n;
    vector< vector<int> > g(n, vector<int>());
    for (int i = 0; i < n; i++)
    {
        int u, k; cin >> u >> k; u--;
        for (int j = 0; j < k; j++)
        {
            int v; cin >> v; v--;
            g[i].push_back(v);
        } 
    }
    vector<bool> seen(n, false);
    vector<int> d(n, -1); d[0] = 0;
    queue<int> q;
    q.push(0);
    int depth = 0;
    while (!q.empty())
    {
        depth++;
        queue<int> qt;
        while (!q.empty())
        {
            qt.push(q.front()); 
            q.pop();
        }
        while (!qt.empty())
        {
            int x = qt.front(); qt.pop();
            seen[x] = true;
            for (int i = 0; i < g[x].size(); i++)
            {
                if(d[g[x][i]] == -1) d[g[x][i]] = depth;
                if (seen[g[x][i]] == false) q.push(g[x][i]);
            }
        }
    }
    for (int i = 0; i < n; i++)
        cout << i + 1 << " " << d[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;
    auto last_visit = i;
    while (!q.empty()) {
      i = q.front();
      for (auto j = last_visit+1; j < n_; ++j) {
        if ((*this)[i][j] && depth_[j] == -1) {
          q.push(j);
          depth_[j] = depth_[i]+1;
        }
      }
      q.pop();
      last_visit = i;
    }
  }

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++: // ALDS1_11_C.cpp
// Graph I - BFS
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

struct Vertex
{
    int id = 0;
    vector<int> adjList;
};
int tt = 0;
void bfs(vector<Vertex> &V, vector<int> &dist, int i)
{
    queue<Vertex> mq;
    mq.push(V[i]);
    dist[i] = 0;
    while(!mq.empty()) {
        Vertex tmpV = mq.front();
        mq.pop();
        for (int j = 0; j < tmpV.adjList.size(); j++) {
            int next = tmpV.adjList[j];
            if (dist[next] == -1) {
                mq.push(V[next]);
                dist[next] = dist[tmpV.id] + 1;
            }
        }
    }
}

int main()
{
    int n;
    cin >> n;
    vector<Vertex> V(n);
    vector<int> dist(n, -1);
    int id;
    int num;
    for (int i = 0; i < n; i++) {
        cin >> id >> num;
        id--;
        V[id].id = id;
        int tmp;
        for (int j = 0; j < num; j++) {
            cin >> tmp;
            tmp--;
            V[id].adjList.push_back(tmp);
        }
    }
    bfs(V, dist, 0);
    for (int i = 0; i < n; i++) {
        cout << i + 1 << " " << dist[i] << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define vector_rsort(x) sort(all(x));reverse(all(x))
#define array_rsort(x,n) sort(x,x+n);reverse(x,x+n);
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

#define Yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define NO cout<<"NO"<<endl
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
/*---------------------------------------------------*/

int n,u,k,v;
int g[105][105];

void init(){
  rep(i,105){
    rep(j,105){
      g[i][j]=INF;
    }
  }
}

void wf(){
  rep(k,105){
    rep(i,105){
      rep(j,105){
	g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
      }
    }
  }
}

int main(){
  init();
  cin>>n;
  rep(i,n){
    cin>>u>>k;
    rep(i,k){
      cin>>v;
      g[u][v]=1;
    }
  }
  wf();
  cout<<1<<" "<<0<<endl;
  for(int i=2;i<=n;i++){
    if(g[1][i]==INF)cout<<i<<" "<<-1<<endl;
    else cout<<i<<" "<<g[1][i]<<endl;
  }
  return 0;
}