#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#define MAX 100010

using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

int N, M, Len, Start;

vector <int> A[MAX];
int G[MAX], Q[MAX], Cost[MAX]= {-1};

void BFS(int nod)
{
    memset(Cost, -1, sizeof(Cost));

    Len = 1;
    Cost[nod] = 0;
    Q[Len] = nod;

    for (int i = 1; i <= Len; i++)
        for (int j = 0; j < G[Q[i]]; j++)
            if (Cost[A[Q[i]][j]] == -1)
            {
                Q[++Len] = A[Q[i]][j];
                Cost[Q[Len]] = Cost[Q[i]] + 1;
            }
}
int main()
{
    int  x, y;
    in>>N>>M>>Start;
    for (int i = 1; i <= M; i++)
    {
        in>>x>>y;
        A[x].push_back(y);
    }
    for (int i = 1; i <= N; i++)
        G[i] = A[i].size();

    BFS(Start);
    for (int i = 1; i <= N; i++)
        out<<Cost[i]<<" ";
    out<<"\n";

    return 0;

}