#include <queue>
#include <fstream>
#include <cstdlib>
#define N_MAX 100011
#define oo 1<<20

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