#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
int i,m,n,a,b,x,lg[100100],sel[100100];
vector <int> g[100100];
queue <int> q;
void bf(int x)
{
	int y,i;
	q.push(x);
	sel[x]=1;
	lg[x]=0;
	while (!q.empty())
	{
		y=q.front();
		for (i=0;i<g[y].size();i++)
			if (sel[g[y][i]]!=1) 
			{
				q.push(g[y][i]);
				sel[g[y][i]]=1;
				lg[g[y][i]]=lg[y]+1;
			}
		q.pop();
	}
}
int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d%d%d",&n,&m,&x);
    for (i=1;i<=m;i++)
    {
		scanf("%d%d",&a,&b);
        g[a].push_back(b);
		//g[b].push_back(a);
	}
    for (i=0;i<=n;i++) lg[i]=-1;
	bf(x);
	for (i=1;i<=n;i++) printf("%d ",lg[i]);
    return 0;
}