#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int k,n,m,viz[100001],x;
typedef struct nod {nod *urm; int la;}NOD;
NOD *p[100001];
void add(int x, int y)
{
	nod *q=new nod;
	q->la=y;
	q->urm=p[x];
	p[x]=q;
}
void citire()
{
	f>>n>>m>>x;
	for (int i=1;i<=m;i++)
	{
		int x,y;
		f>>x>>y;
		add(x,y);
	}
}
int INF=99999999;
int r;
int dist[100001];
void dfs(int i,int r)
{
	viz[i]=1;
	if (dist[i]>r) dist[i]=r;
	for (nod *q=p[i];q;q=q->urm) if (viz[q->la]==0)	dfs(q->la,r+1);
}
int main()
{
	citire();
	for (int i=1;i<=n;i++)
		dist[i]=INF;
	dfs(x,0);
	for (int i=1;i<=n;i++)
		if (dist[i]==INF) g<<-1<<' ';
	else g<<dist[i]<<' ';
	return 0;
}