#include <cstdio>
#include <vector>
#include <climits>

using namespace std;

#define NMAX 100003

int D[NMAX];
int N,M,S,i,X,Y;
vector < int > G[NMAX];

void BFS(int nod)
{
    vector < int > :: iterator it;

    for (it=G[nod].begin();it!=G[nod].end();++it)
    {
        if (D[*it]<D[nod]+1) continue;

        D[*it]=D[nod]+1;
        BFS(*it);
    }
}

int main()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);

scanf("%d%d%d",&N,&M,&S);

for (i=1;i<=N;++i)
D[i]=INT_MAX;

for (i=1;i<=M;++i)
{
    scanf("%d%d",&X,&Y);
    G[X].push_back(Y);
}

D[S]=0;
BFS(S);

for (i=1;i<=N;++i)
(D[i]==INT_MAX) ? printf("-1 ") : printf("%d ",D[i]);

return 0;
}