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

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

std::vector<int> noduri[100002];
int n, m, s;
int visited[100002];

void citire()
{
    fin>>n>>m>>s;
    int a, b;

    for(int i = 0; i < m; i++)
    {
        fin>>a>>b;
        if(a != b)
        {
            noduri[a].push_back(b);
        }
    }
    for(int i = 1; i <= n; i++)
    {
        visited[i] = -1;
    }
}

void bfs(int nod)
{
    std::queue<int> indici;
    indici.push(nod);
    visited[nod] = 0;

//    std::cout<<nod<<' ';
    int nr = 1;

    while(indici.size())
    {
        for(int i = 0; i < noduri[indici.front()].size(); i++)
        {
            if(visited[noduri[indici.front()][i]] == -1)
            {
//                if(visited[indici.front()] + 1 == 0)
//                {
//                    std::cout<<indici.front()<<' '<<noduri[indici.front()][i]<<'\n';
//                }
                indici.push(noduri[indici.front()][i]);
                visited[noduri[indici.front()][i]] = visited[indici.front()] + 1;///nr;
            }
        }
        indici.pop();
    }

    for(int i = 1; i <= n; i++)
    {
//        std::cout<<i<<": "<<visited[i]<<'\n';
        fout<<visited[i]<<' ';
    }
}

int main()
{
    citire();
    bfs(s);
    return 0;
}