Go: package main

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

type Queue []int

func (q *Queue) push(v int) {
	*q = append(*q, v)
}

func (q *Queue) pop() int {
	v := (*q)[0]
	*q = (*q)[1:]
	return v
}

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

	nVerts := scanInt(sc)
	graph := make([][]int, nVerts+1)

	for i := 0; i < nVerts; i++ {
		u := scanInt(sc)
		nDegrees := scanInt(sc)

		graph[u] = make([]int, nDegrees)
		for d := 0; d < nDegrees; d++ {
			graph[u][d] = scanInt(sc)
		}
	}

	paths := make([]int, nVerts+1)

	queue := Queue(make([]int, 0))
	queue.push(1)
	paths[1] = 1

	for len(queue) > 0 {
		u := queue.pop()
		d := paths[u] + 1
		for _, v := range graph[u] {
			if paths[v] == 0 {
				paths[v] = d
				queue.push(v)
			}
		}
	}

	w := bufio.NewWriter(os.Stdout)
	for i := 1; i <= nVerts; i++ {
		fmt.Fprintf(w, "%d %d\n", i, paths[i]-1)
	}
	w.Flush()
}

func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

C++: #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph=vector<vector<int>>;
typedef long long ll;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

int main(){
    int n;cin>>n;
    Graph G(n+2);
    for(int i=0;i<n;i++){
        int u,k;cin>>u>>k;
        for(int j=0;j<k;j++){
            int v;cin>>v;
            G[u].push_back(v);
        }
    }
    bool ans_check=false;
    vector<int> b(n+2,1000000);
    queue<int> q;
    b[1]=0;
    q.push(1);
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int A=0;A<G[x].size();A++){
            int check_x=G[x][A];
            if(b[check_x]==1000000){
                q.push(check_x);
                b[check_x]=b[x]+1;
            }
        }
    }
    for(int i=1;i<n+1;i++){
        if(b[i]==1000000) b[i]=-1;
        cout<<i<<' '<<b[i]<<endl;
    }
}

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;
    }
  }

  dfs(0);

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000 // 10^12
#define MOD 1000000007 // 10^9+7
#define PB push_back
#define MP make_pair

const int MAX_N = 100;

int n, u, k, v;

vector<int> G[MAX_N];
int d[MAX_N]; // distance from 0

int main() {
    // input
    cin >> n;
    REP(i, n) {
        cin >> u >> k;
        REP(j, k) {
            cin >> v;
            G[u-1].PB(v-1);
        }
    }

    // init d
    REP(i, n) d[i] = -1;

    // BFS
    queue<int> Q;
    Q.push(0);
    d[0] = 0;
    while (Q.size()) {
        int pos = Q.front(); Q.pop();
        REP(i, G[pos].size()) {
            int to = G[pos][i];
            if (d[to] != -1) continue;
            Q.push(to);
            d[to] = d[pos] + 1;
        }
    }

    // output
    REP(i, n) {
        int id = i + 1;
        printf("%d %d\n", id, d[i]);
    }

    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    vector<vector<int>> g(n);
    rep(i, n){
        int u, k;
        cin >> u >> k;
        --u;

        rep(j, k){
            int v;
            cin >> v;
            --v;

            g[u].push_back(v);
        }
    }

    queue<int> q;
    vector<int> dist(n, -1);
    q.push(0);
    dist[0] = 0;
    while(!q.empty()){
        int v = q.front();
        q.pop();
        
        for(int nv : g[v]){
            if(dist[nv] != -1) continue;

            dist[nv] = dist[v] + 1;
            q.push(nv);
        }
    }

    rep(i, n) cout << i+1 << " " << dist[i] << endl;

    return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
 
using namespace std;
 
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
 
const int INF=1<<29;
const double EPS=1e-9;
 
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

std::vector<vector<int> > G;
std::vector<int> flag;
std::vector<int> in;
int N;
typedef pii P;

int main(int argc, char const *argv[]) {
	
	cin >> N;

	for (int i = 0; i < N; ++i) {
		G.push_back(vector<int>());
		flag.push_back(0);
		in.push_back(100000000);
		for (int j = 0; j < N; ++j) {
			G[i].push_back(0);
		}
	}

	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[u][v] = 1;
		}
	}
	queue<P> q;
	q.push(mp(0, 0));
	while(!q.empty()) {
		P u = q.front(); q.pop();
		int dist = u.second;
		if (dist > in[u.first]) continue;
		in[u.first] = dist;
		flag[u.first] = 1;
		for (int i = 0; i < N; ++i) {
			if (flag[i] == 0 && G[u.first][i] == 1) {
				q.push(mp(i, dist + 1));
			}
		}
	}

	for (int i = 0; i < N; ++i) {
		if (in[i] == 100000000) {
			in[i] = -1;
		}
		cout << i + 1 << " " << in[i] << endl;
	}

	return 0;
}

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;
  }
  

}