#include <bits/stdc++.h>
#define Nmax 100002
using namespace std;
//ifstream f("bfs.in");
//ofstream g("bfs.out");
int N,M,X,x,y,k;
vector <int>Neighbour[Nmax];
queue <int>c;
vector <int>used(Nmax,-1);
int v,node;
void Read()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    //f>>N>>M>>X;
    scanf("%d%d%d",&N,&M,&X);
    for(k=1;k<=M;k++)
    {
        //f>>x>>y;
        scanf("%d%d",&x,&y);
        Neighbour[x].push_back(y);
    }
}

void bfs()
{
    //for(k=1;k<=N;k++)used[k]=-1;
    c.push(X);used[X]=0;
    while(!c.empty())
    {
        v=c.front();c.pop();
        for(k=0;k<Neighbour[v].size();k++)
        {
            node=Neighbour[v][k];
            if(used[node]==-1)
                used[node]=used[v]+1,c.push(node);
        }
    }
}

void type()
{
    for(k=1;k<=N;k++)
        //g<<used[k]<<" ";
    printf("%d ",used[k]);
}
int main()
{
    Read();
    bfs();
    type();
    return 0;
}