#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
typedef struct muchii
{
    long long x,y;
};
muchii muchie[1000010];
ifstream f("bfs.in");
ofstream g("bfs.out");
std::queue<long long> stiva;
long long n,m,s,i,j,v[1000010],c[1000010],distanta=0,ok=0;
void citire()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>muchie[i].x>>muchie[i].y;
        //if(muchie[i].x==s && muchie[i].y==s) ok=1;
    }
}

void bfs()
{
    while(!stiva.empty())
    {
        long long nod=stiva.front();
        v[nod]=1;
        distanta=c[nod]+1;
        stiva.pop();
        for(i=1;i<=m;i++)
        {
            if(muchie[i].x == nod && v[muchie[i].y]!=1)
            {
                stiva.push(muchie[i].y);
                c[muchie[i].y]=distanta;
            }
        }
    }
}

int main()
{
    citire();
    stiva.push(s);
    bfs();
    for(i=1;i<=n;i++)
    {
        //if(ok==0 && i==s) g<<-1<<" ";
       // else
            if(c[i]==0 && i!=s) g<<-1<<" ";
            else g<<c[i]<<" ";
    }
    return 0;
}