#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> graph[100005];
int dist[100006];
int viz[100006];
int coada[100006];


void BFS(int s)
{
    dist[s] = 0;
    viz[s] = 1;
    coada[1] = s;
    int left, right;
    left = right = 1;
    while (left <= right)
    {
        int index = coada[left];
        int lim = graph[index].size();
        for (int i = 0; i < lim; i++)
        {
            int vecin = graph[index][i];
            if (!viz[vecin])
            {
                dist[vecin] = dist[index] + 1;
                viz[vecin] = 1;
                coada[++right] = vecin;
            }
        }
        left++;
    }
}

int main()
{
    int n, m, s;
    f>>n>>m>>s;

    int a, b;
    for (int i = 1; i <= n; i++)
        dist[i] = -1;
    for (int i = 0; i < m; i++)
    {
        f>>a>>b;
        graph[a].push_back(b);
    }

    BFS(s);
    for( int i = 0; i <= n; i++)
    {
        g<<dist[i]<<' ';
    }

    return 0;
}