#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int const N=(int)1e5+5;
vector <int> v[N];
int n,m,s,d[N];
void BFS(int start)
{
    queue <int>q;
    d[s]=1;
    while(q.size())
    {
        int nod=q.front();
        vector <int>::iterator it;
        for(it=v[nod].begin();it!=v[nod].end();it++)
        {
            if(!d[*it])
            {
                d[*it]=d[nod]+1;
                q.push(*it);
            }
        }
        q.pop();
    }
}
int main()
{
    fin>>n>>m>>s;
    int x,y;
    while(m--)
    {
        fin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    BFS(s);
    for(int i=1;i<=n;i++)
        fout<<d[i]-1<<' ';
}