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

int n,m,s,ap[100100];
queue<int> Q;
vector<int> A[100100];

int main()
{
	ifstream in("bfs.in");
	ofstream out("bfs.out");
	
	in>>n>>m>>s;
	for(int i=1;i<=m;++i)
	{
		int x,y;
		in>>x>>y;
		A[x].push_back(y);
	}
	
	Q.push(s);
	ap[s]=1;
	for(;!Q.empty();Q.pop())
	{
		int ret=Q.front();
		for(vector<int>::iterator it=A[ret].begin();it!=A[ret].end();++it)
		{
			if(!ap[*it])
			{
				ap[*it]=ap[ret]+1;
				Q.push(*it);
			}
		}
	}
	
	for(int i=1;i<=n;++i)
	{
		out<<ap[i]-1<<' ';
	}
	
	out.close();
	return 0;
}