#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "bfs"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 100001
#define INF 0xffffff

vector<int>g[MAX];
int n,s,dist[MAX],c[MAX];

void BFS()
{
	int p,u,x;
	for(int i=1;i<=n;i++)dist[i]=INF;
	c[p=u=1]=s;
	dist[s]=0;
	while(p<=u)
	{
		x=c[p++];
		for(int i=0;i<g[x].size();i++)
			if(dist[g[x][i]]==INF)
			{
				dist[g[x][i]]=dist[x]+1;
				c[++u]=g[x][i];
			}
	}
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);	
	// start
	int m,x,y;
	scanf("%d %d %d",&n,&m,&s);
	for(int i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		g[x].push_back(y);
	}
	BFS();
	for(int i=1;i<=n;i++)printf("%d ",i==s?0:dist[i]==INF?-1:dist[i]);
	return 0;
}