#include <stdio.h>
#include <algorithm> 
#include <vector> 
#include <queue>
using namespace std;
vector<int> a[100001];
queue<int> q;
int n,m,x0,viz[100001];
vector<int>::iterator it;


void read()
{int x,y;
scanf("%d %d %d",&n,&m,&x0);
for(int i=1;i<=m;i++)
{scanf("%d %d",&x,&y);
a[x].push_back(y);}
}

void bf()
{int x;
fill(&viz[0],&viz[n+1],-1);
viz[x0]=0;
q.push(x0);

while(!q.empty())
{x=q.front();
q.pop();
for(it=a[x].begin();it!=a[x].end();it++)
	if(viz[*it]==-1)
	{viz[*it]=viz[x]+1;
	q.push(*it);
	}
}

for(int i=1;i<=n;i++)
	printf("%d ",viz[i]);

}


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


return 0;}