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

ifstream in("bfs.in");
ofstream out("bfs.out");

const int N=1000004;
vector<int> a[N];
queue<int> q;
bool use[N];
int dist[N];

void bfs(int x)
{
	q.push(x);
	use[x]=true;
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(vector<int>:: iterator i=a[x].begin();i!=a[x].end();i++)
		{
			if(!use[*i])
			{
				use[*i]=true;
				dist[*i]=dist[x]+1;
				q.push(*i);
			}
		}
	}
}

int main()
{
	int x,y,i,n,m,s;
	in>>n>>m>>s;
	while(m--)
	{
		in>>x>>y;
		a[x].push_back(y);
	}
	dist[s]=1;
	bfs(s);
	for(i=1;i<=n;i++)
		out<<dist[i]-1<<" ";
}