#include <iostream>
#include <vector>
#include <queue>

using namespace std;

vector <int> adj[100];
int visited[100];
int dist[100];

void bfs(int node)
{
  visited[node] = true;
  dist[node] = 0;
  queue <int> q;
  q.push(node);
  while(!q.empty())
  {
    int u = q.front();
    q.pop();
    for(int i = 0; i < adj[u].size(); i++)
    {
        int v = adj[u][i];
        if(visited[v] == false)
        {
            dist[v] = dist[u] + 1;
            visited[v] = true;
            q.push(v);
        }
    }
  }
}

int main()
{
    int node, edge;
    cin >> node >> edge;
    for(int i = 0; i < edge; i++)
    {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
    }
    bfs(1);
    for(int i = 1; i <= node; i++)
      cout << "Node -> " << i << " distance of this node -> " << dist[i] << '\n';
}