#include <cstdio>
#include <vector>
using namespace std;
#define nmax 100010

int n, m, s, cost[nmax], c[nmax], g[nmax];
vector <int> a[nmax];

void bfs(int nod)
{
	int i, j, h=1;
	for (i=1; i<=n; i++) cost[i]=-1;
	c[1]=nod;
	cost[nod]=0;
	for (i=1; i<=h; i++)
		for (j=0; j<g[c[i]]; j++)
			if (cost[a[c[i]][j]]==-1)
			{
				c[++h]=a[c[i]][j];
				cost[c[h]]=cost[c[i]]+1;
			}
}

int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d %d %d",&n,&m,&s);
	int i, x, y;
	for (i=1; i<=m; i++)
	{
		scanf("%d %d",&x,&y);
		a[x].push_back(y);
	}
	for (i=1; i<=n; i++) g[i]=a[i].size();
	bfs(s);
	for (i=1; i<=n; i++) printf("%d ",cost[i]);
}