#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,i,x,y;
char viz[100005],dis[100005];
vector<int> v[100005];
queue<int >q;
int main()
{
    fin>>n>>m>>s;
    for(i=0;i<m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    viz[s]=1;
    q.push(s);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i];
            if(!viz[vecin])
            {
                dis[vecin]=dis[nod+1];
                q.push(vecin);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(!viz[i])
            dis[i]=-1;
        fout<<dis[i]<<" ";
    }



    return 0;
}