#include <fstream>
#include <queue>

using namespace std;
vector <int> v[100005];
queue <int> q;
int viz[100005],cnt=0,f[100005];
int bfs(int a)
{
	q.push(a);
	viz[a]=1;
	while(!q.empty())
	{
		a=q.front();
		for(int i=0;i<v[a].size();i++)
		{
			if(viz[v[a][i]]==0)
			{
				viz[v[a][i]]=1;
				f[v[a][i]]=f[a]+1;
				q.push(v[a][i]);
			}
		}
		q.pop();
	}
	return 0;
}
int main()
{
	ifstream cin("bfs.in");
	ofstream cout("bfs.out");

    int n,m,x,y,s;
    cin>>n>>m>>s;
    for(int i=0;i<m;i++)
	{
		cin>>x>>y;
		v[x].push_back(y);
	}

	bfs(s);
	for(int i=1;i<=n;i++)
	{
		if(f[i]==0 && i!=s)
			cout<<-1<<" ";
		else
			cout<<f[i]<<" ";
	}

    return 0;
}