#include <cstdio>
#include <vector>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;

vector<int> list[100005];
int minim[100005];
queue<int> q;

void bfs()
{	
	while(q.size())
	{
		int nod=q.front();
		q.pop();
		for(unsigned int i=0;i<list[nod].size();i++)
		{
			int next_nod=list[nod][i];
			
			if(minim[nod]+1<minim[next_nod])
			{
				minim[next_nod]=minim[nod]+1;
				q.push(next_nod);
			}
		}
		
	}
	

	return;
}

int main()
{
	int n,m,s,a,b;
	memset(minim,127,sizeof(minim));
	freopen("bfs.in","r", stdin);
	freopen("bfs.out","w", stdout);
	scanf("%d %d %d",&n,&m,&s);
	for(int i=1;i<=m;i++)
	{
		scanf("%d %d",&a,&b);
		list[a].push_back(b);
	}
	q.push(s);
	minim[s]=0;
	bfs();
	for(int i=1;i<=n;i++)
		printf("%d ",(minim[i]==2139062143)?-1:minim[i]);
	
	return 0;
}