#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

const int MAX = 100000;
vector<vector<int>> graf;
int dist[MAX+1];
queue<int>q;

void bfs (int start)
{
    dist[start]=1;
    q.push(start);
    while( !q.empty() )
    {
        int nod=q.front();
        q.pop();
        for(int vec:graf[nod])
        {
            if(dist[vec]==0)
            {
                dist[vec]=dist[nod]+1;
                q.push(vec);
            }
        }
    }
}
int main()
{
    int n,m,start;
    in>>n>>m>>start;
    graf.resize(n+1);
    for(int i=0; i<m; ++i)
    {
        int node1, node2;
        in>>node1>>node2;
        graf[node1].push_back(node2);
        graf[node1].push_back(node2);
    }
    bfs(start);
    for(int i=1; i<=n; ++i) // n - nodul la care se opreste
    {
        if(dist[i]==0 && i!=start)
            out<<"-1 ";
        else
            out<<dist[i]-1<<" ";
    }
    return 0;
}