#include <queue>
#include <vector>
#include <fstream>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#define N_MAX 100011

using namespace std;

int d[N_MAX];
queue< int > Q;
vector< int > G[N_MAX];
vector< int >::const_iterator it, iend;

int main()
{
	int N, M, S, x, y;
	ifstream in( "bfs.in" );
	ofstream out( "bfs.out" );

	for( in>>N>>M>>S; M; --M )
	{
		in>>x>>y;
		G[x].push_back( y );
	}
	fill( d+1, d+N+1, -1 );
	d[S]=0;
	for( Q.push(S); !Q.empty(); Q.pop() )
	{
		x=Q.front();
		for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
			if( -1 == d[*it] )
			{
				d[*it]=d[x]+1;
				Q.push( *it );
			}
	}
	copy( d+1, d+N+1, ostream_iterator<int>( out, " " ) );
	out<<'\n';

	return EXIT_SUCCESS;
}