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

using namespace std;

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

const int nlim=100005;

int N,M;
vector <int> muchii[nlim];
int distanta[nlim];
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 citire()
{
    int S;
    f>>N>>M>>S;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        f>>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++)
        g<<distanta[i]<<" ";
}
int main()
{
    citire();
    return 0;
}