#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream o("bfs.out");
int main()
{
    int noduri, arce, sursa, a, b;
    f >> noduri >> arce >> sursa;
    vector<int> graph[noduri + 1];
    for (int i = 0; i < arce; i++)
    {
        f >> a >> b;
        graph[a].push_back(b);
    }

    int dist[noduri + 1], queue[noduri + 1], L = 1;
    for (int i = 1; i <= noduri; i++)
        dist[i] = -1;
    dist[sursa] = 0;
    queue[L] = sursa;
    for (int i = 1; i <= L; i++)
    {
        for (vector<int>::iterator it = graph[queue[i]].begin(); it != graph[queue[i]].end(); ++it)
        {
            if (dist[*it] == -1)
            {
                dist[*it] = dist[queue[i]] + 1;
                queue[++L] = *it;
            }
        }
    }

    for (int i = 1; i <= noduri; i++)
        o << dist[i] << " ";
}