#include <queue>
#include <vector>
#include <fstream>
#include <iterator>
#include <algorithm>
#define N_MAX 100011
#define oo 1<<29
#define pr pair< in, int >

using namespace std;
int d[N_MAX];
queue< int > Q;
vector< int > G[N_MAX];
vector< int >::const_iterator it, iend;
int main(void)
{
    int N, M, S, x, y;
    ifstream in( "bfs.in" );
    for( in>>N>>M>>S; M; --M )
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    fill( d, d+N+1, -1 );
    for( Q.push(S), d[S]=0; !Q.empty(); )
    {
        x=Q.front(); Q.pop();
        for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
        {
            if( -1 == d[*it] || d[*it] > d[x]+1 )
            {
                d[*it]=d[x]+1;
                Q.push(*it);
            }
        }
    }
    ofstream out( "bfs.out" );
    copy( d+1, d+N+1, ostream_iterator<int>( out, " ") );
    out<<'\n';
    return EXIT_SUCCESS;

}