#include <bits/stdc++.h>

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

int N,M;
const int NLIM = 100005;
vector <int> Muchii[NLIM];
queue <int> Coada;
int distanta[NLIM];

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 citire()
{
    int nodStart;
    fin>>N>>M>>nodStart;
    for (int i=1;i<=M;i++)
    {
        int x,y;
        fin>>x>>y;
        Muchii[x].push_back(y);
    }
    for (int i=1;i<=N;i++)
        distanta[i] = -1;
    distanta[nodStart] = 0;
    Coada.push(nodStart);
    BFS();
    for (int i=1;i<=N;i++)
        fout<<distanta[i]<<" ";
}

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