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

#define nmax 100001

int N,M,S;
int sol[nmax];
vector <int> V[nmax];

void bf ()
{
	queue <int> Q;
	Q.push (S); sol[S]=1;

	while (!Q.empty())
	{
		int i = Q.front(); Q.pop();

		for (int j=0; j<V[i].size(); ++j)
			if (!sol[V[i][j]])
			{
				Q.push(V[i][j]);
				sol[V[i][j]] = sol[i]+1;
			}
	}
}

int main ()
{
	freopen ("bfs.in","r",stdin);
	freopen ("bfs.out","w",stdout);

	cin>>N>>M>>S;
	while (M--)
	{
		int a,b; cin>>a>>b;
		V[a].push_back(b);
	}

	bf();
	for (int i=1; i<=N; ++i) cout<<sol[i]-1<<' ';
	return 0;
}