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

int n;
std::vector<int> L[100001];
int d[100001];

void bfs(int s){
    std::queue<int> q;

    for ( int i = 1; i <= n; i++ ){
        d[i] = 1e9;
    }
    d[s] = 0;
    q.push(s);
    while ( !q.empty() ){
        int nod = q.front();
        q.pop();
        for ( int i = 0; i < L[nod].size(); i++){
            int vecin = L[nod][i];
            if ( d[vecin] > d[nod] + 1){
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
        }  
    }
}

int main(){
    std::ifstream fin("bfs.in");
    std::ofstream fout("bfs.out");


    int m;
    fin >> n >> m;
    for ( int i = 0; i < m; i++ ){
        int x, y;
        fin >> x >> y;
        L[x].push_back(y);
        // L[y].push_back(x);
    }
    bfs(1);
    for ( int i = 1; i <= n; i++ ){
        if(d[i] == 1e9){
            fout << -1 << ' ';
        }
        else{
            fout << d[i] << ' ';
        }
    }
}