#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ofstream cout("bfs.out");
ifstream cin ("bfs.in");
vector <int> dist={-1};
vector <vector <int> > gr;
queue <int> q;
void veccheck(int cur)
{
    for(int i=0;i<gr[cur].size();i++)
    {
        if( dist[gr[cur][i]]==0)
        {
        dist[gr[cur][i]]=dist[cur]+1;;
        q.push(gr[cur].back());
        }
    }
}
int main()
{
    int n,m,s;
    cin>>n>>m>>s;
    gr.resize(n+1);
    dist.resize(n+1);
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        gr[a].push_back(b);
        gr[b].push_back(a);
    }
    int val=0;
    q.push(s);
    dist[s]=0;
    while(! q.empty())
    {
        veccheck(q.back());
        q.pop();
    }
    for(int i=1;i<=n;i++)
        cout<<dist[i]<<' ';
    return 0;
}