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

#define nod first
#define cost second
using namespace std;
int n,m,s,i,j,fv[100005];

ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue< pair < int , int > >Q;
vector< int > v[100005];
pair < int,int > aux;
int main()
{
    fin>>n>>m>>s;
    for( int r = 1; r <= m; r++ )
    {
        fin>>i>>j;
        v[ i ].push_back( j );
    }
    Q.push( { s, 0 } );
    while( !Q.empty( ) )
    {
        aux = Q.front( );
        Q.pop( );
        fv[ aux.nod ] = aux.cost;
        for( i = 0; i < v[ aux.nod ].size( ); i++ )
        {
            if( fv[ v[ aux.nod ][ i ] ] == 0 and v[ aux.nod ][ i ] != s )
            {
                 Q.push( { v[ aux.nod ][ i ], aux.cost + 1 } );
            }

        }
    }
    for( i = 1; i <= n; i++ )
    {
        if( s != i and fv[ i ] == 0 )
            fout<<-1<<" ";
        else
            fout<<fv[ i ]<<" ";
    }
    return 0;
}