#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
int M,N;
vector <vector <int> > graph;
vector <int> visited;

void bfs(int vertex)
{
	if(vertex<0 || vertex>N-1) return;

	queue <int> q;
	int element,i;

	q.push(vertex);
	visited[vertex]=0;
	while (!q.empty())
	{
		element=q.front();
		for(i=0;i<graph[element].size();i++)
        {  if(visited[graph[element][i]]==-1)
            {
                q.push(graph[element][i]);
                visited[graph[element][i]]=visited[element]+1;

            }
        }

         q.pop();

	}

}


int main()
{
    int x,y,i,S;
	ifstream fin("bfs.in");
	ofstream fout("bfs.out");
	fin>>N>>M>>S;
	graph.resize(N);
	visited.resize(N,-1);

	for(i=0;i<M;i++)
    {
        fin>>x>>y;
        x--;
        y--;
        graph[x].push_back(y);
    }
    fin.close();
    bfs(S-1);
    for(i=0;i<N;i++)
        fout<<visited[i]<<" ";

	return 0;
}