#include <iostream>
#include <queue>
#include <map>
#include <vector>
#include <fstream>


using namespace std;
int n,m;
ifstream fin("bfs.in");
ofstream fout("bfs.out");


void bfs(  map<int, vector<int>> graf,int nod)
{queue<int> coada;
bool visited[n];
int distanta[n];
int predecesor[n];
    for(int i = 1; i <=n; i++)
        {visited[i] = false;
        distanta[i] =-1;
        predecesor[i] = -1;}
visited[nod] = true;
distanta[nod] = 0;
coada.push(nod);

while(!coada.empty())
    {

       int s = coada.front();
        coada.pop();


      vector<int>::iterator it;
        for ( it = graf[s].begin(); it != graf[s].end(); ++it)
        {

            if (!visited[*it])
            {
                distanta[*it] = distanta[s] + 1;
                predecesor[*it] = s;

                visited[*it] = true;

                coada.push(*it);
            }


        }
    }
    for(int i=1;i<=n;i++)
        fout<<distanta[i]<<" ";

}

int main()
{
    map<int, vector<int>> graf;
int x,y,nod;
fin>>n>>m>>nod;
for(int i=0;i<m;i++)
    {fin>>x>>y;
    graf[x].push_back(y);}
bfs(graf,nod);

    return 0;
}