#include <iostream>
#include <stdio.h>
#include <vector>
#include <fstream>
#define nMax 100010
using namespace std;
int N,M,L,Start;
vector <int> A[nMax];
int G[nMax],S[nMax],Cost[nMax];
ifstream f("bfs.in");
ofstream g("bfs.out");

void BFS(int nod)
{
    int i, j;

    memset(Cost, -1, sizeof(Cost));  /// Marchez toate nodurile ca fiind nevizitate

    ///  Introduc nodul de start in coada
    L = 1;
    Cost[nod] = 0;
    S[L] = nod;

    for (i = 1; i <= L; i++) ///  Elimin pe rand nodurile din coada
        for (j = 0; j < G[S[i]]; j++)    ///  Parcurg vecinii nodului ce urmeaza sa fie eliminat
            if (Cost[A[S[i]][j]] == -1)
            {
                ///  Adaug vecinii nevizitati in coada si le calculez distanta
                S[++L] = A[S[i]][j];
                Cost[S[L]] = Cost[S[i]] + 1;
            }
}
int main()
{
    int x,y;
    f>>N>>M;
    for (int i=1;i<=M;i++)
    {
        f>>x>>y;
        A[x].push_back(y);
    }
    for(int i=1;i<=N;i++)
    {
        G[i] = A[i].size();
    }
     BFS(Start);
     for (int i=1;i<=n;i++)
        g<<Cost[i]<<" ";
    return 0;
}