#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define MAX 100001

ifstream f("bfs.in");
ofstream g("bfs.out");

int n , m , nod , x , y ,i ;
vector < int > G[MAX];
queue < int > Q;
bool used[MAX];
int d[MAX];

void bfs ( int i )
{
    int aux;
    Q.push(i);
    d[i] = 0;
    used[i] = true;
    while( !Q.empty() )
    {
        aux = Q.front();
        Q.pop();
        for ( vector < int > ::iterator j = G[aux].begin() ; j != G[aux].end(); j++ )
        {
            if(!used[ (*j) ])
            {
                d[ (*j) ] = d[aux ] + 1;
                Q.push( (*j) );
                used [ (*j) ] = true;
            }
        }
    }
}

int main()
{
    f >> n >> m >> nod;
    for ( ; m--; )
    {
        f >> x >> y;
        G[x].push_back(y);
    }
    bfs(nod);

    for ( i = 1 ; i <= n ; i++ )
    {
        if ( i == nod ) g << 0 << " " ;
        else if ( d[i] == 0 ) g << -1 << " " ;
                else g << d[i] << " " ;
    }

    return 0;
}