#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in ("bfs.in");
ofstream out("bfs.out");
int const N=100005;
vector <int> a[N];
queue <int> q;
int m,n,s,d[N];
void citire()
{
    in>>n>>m>>s;    int x,y;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
}
void init()
{
    for(int i=1;i<=n;i++)
        d[i]=-1;
}
void bfs(int x)
{
    d[x]=0; q.push(x);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0;i<a[x].size();i++)
        {
            int y=a[x][i];
            if(d[y]==-1)
            {
                d[y]=1+d[x];
                q.push(y);
            }
        }
    }
}
int main()
{
    citire();   init();    bfs(s);
    for(int i=1;i<=n;i++)
        out<<d[i]<<" ";
    out<<"\n";
    return 0;
}