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

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

int n, m, s;

const int SIZE = 100005;
std::vector<int> muchii[SIZE];
int distanta[SIZE];

std::queue<int> coada;

void bfs()
{
    int nod, vecin;

    while(!coada.empty())
    {
        nod = coada.front();
        coada.pop();
        for(unsigned int i = 0; i < muchii[nod].size(); i++)
        {
            vecin = muchii[nod][i];
            if(distanta[vecin] == -1)
            {
                coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1 ;
            }
        }
    }
}

void rezolvare()
{
    int x, y;

    fin >> n >> m >> s;

    while(m--)
    {
        fin >> x >> y;
        muchii[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        distanta[i] = -1;
    distanta[s] = 0;

    coada.push(s);

    bfs();

    for(int i = 1; i <= n; i++)
        fout << distanta[i] << " ";
}

int main()
{
    rezolvare();
    return 0;
}