#include <fstream>
#include <stdio.h>
#include <vector>
using namespace std;
ifstream f("/Users/petrisorstefan/Documents/Fisiere/bfs.in");
ofstream g("/Users/petrisorstefan/Documents/Fisiere/bfs.out");

int n, m, l, start;
vector <int> A[100010];
int G[100010], S[100010], Cost[100010];

void BFS(int nod)
{
    int i, j;

    for(int i=0;i<=100010;i++)
        Cost[i]=-1;
    l = 1;
    Cost[nod] = 0;
    S[l] = nod;

    for (i = 1; i <= l; i++)
        for (j = 0; j < G[S[i]]; j++)
            if (Cost[A[S[i]][j]] == -1)
            {
                S[++l] = A[S[i]][j];
                Cost[S[l]] = Cost[S[i]] + 1;
            }
}

int main()
{

    int i, x, y;

    f>>n>>m>>start;

    for (i = 1; i <= m; i++)
    {
        f>>x>>y;
        A[x].push_back(y);
    }

    for (i = 1; i <= n; i++)
        G[i] = A[i].size();

    BFS(start);

    for (i = 1; i <= n; i++)
        g<<Cost[i]<<" ";

    return 0;
}