#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
queue<int> q;
vector<int> a[100005];
int d[100005],v[100005];
int main()
{
	int n,m,s,i,x,y;
	in=fopen("bfs.in","r");
	out=fopen("bfs.out","w");
	fscanf(in,"%d%d%d",&n,&m,&s);
	FOR(i,1,m)
	{
		fscanf(in,"%d%d",&x,&y);
		a[x].pb(y);
	}
	q.push(s);
	v[s]=1;
	while(!q.empty())
	{
		int nod=q.front();
		vector<int>::iterator it;
		fori(it,a[nod])
			if (!v[*it])
			{
				q.push(*it);
				v[*it]=1;
				d[*it]=d[nod]+1;
			}
		q.pop();
	}
	FOR(i,1,n)
		fprintf(out,"%d ",v[i]?d[i]:-1);
	fclose(in);
	fclose(out);
	return 0;
}