#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define Nmax 100001
using namespace std;

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

int N, M, nodStart;
int Dist[Nmax];
vector <int> G[Nmax];
queue <int> Coada;
void Read()
{
    int x, y;
    fin >> N >> M >> nodStart;
    for (int i=1; i<=M; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
}
void BFS(int nodStart)
{
    Dist[nodStart] = 0;
    Coada.push(nodStart);
    while (!Coada.empty())
    {
        int nodCurent = Coada.front();
        Coada.pop();
        for (unsigned int i=0; i<G[nodCurent].size(); i++)
        {
            int Vecin = G[nodCurent][i];
            if (Dist[Vecin] == -1)
            {
                Coada.push(Vecin);
                Dist[Vecin] = Dist[nodCurent] + 1;
            }
        }
    }
}
int main()
{
    Read();
    for (int i=1; i<=N; i++)
        Dist[i] = -1;
    BFS(nodStart);
    for (int i=1; i<=N; i++)
        fout << Dist[i] << " ";
    return 0;
}