#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int nmax=10000;
vector <int> G[nmax+5];
queue <int> q;
bool viz[nmax+5];
int d[nmax+5],pred[nmax+5];
ifstream fin("bfs.in");
ofstream fout("bfs.out");
void bfs(int u)
{
    int v;
    viz[u]=1;
    q.push(u);
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(int j=0;j<G[u].size();j++)
        {
            v=G[u][j];
            if(!viz[v])
            {
                viz[v]=1;
                d[v]=d[u]+1;
                pred[v]=u;
                q.push(v);
            }
        }
    }
}
int main()
{
    int n,m,i,u,v,x;
    fin>>n>>m>>x;
    for(i=1;i<=m;i++)
    {
        fin>>u>>v;
        G[u].push_back(v);
        G[u].push_back(u);
    }
    bfs(x);
    for(i=1;i<=n;i++)
    {
        if(viz[i])
            fout<<d[i]<<" ";
        else fout<<"-1 ";
    }
    return 0;
}