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

using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

void bfs(int S, int N, const vector<vector<int>>&l, vector<int>& dist)
{
    dist.assign(N+1, -1);    //-1 daca nu s vizitate
    queue<int>q;      //nodurile de viiztat
    dist[S] = 0;
    q.push(S);
    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int vecin : l[nod])
        {
            if (dist[vecin] == -1){    //nu e vizitat
                dist[vecin] = dist[nod]+1;
                q.push(vecin);
            }
        }
    }
}

int main()
{
    int N, M, S, x, y;
    vector<vector<int>>l(N+1);
    for (int i = 0; i < M; i++) {
        in >> x >> y;
        l[x].push_back(y);
        l[y].push_back(x);
    }
    vector<int>dist;
    bfs(S, N, l, dist);
    for(int i = 1; i <= N; i++)
        out << dist[i] <<" ";
    out << "\n";

    return 0;
}