#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#define maxn 100010
using namespace std;
vector < int > G[maxn];
queue < int > q;
int n,m,S,i,x,y,M[maxn];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&S);
    while(m--)
        scanf("%d%d",&x,&y), G[x].push_back(y);
    q.push(S);
    M[S]=1;
    while(!q.empty())
    {
        x=q.front();
        for(i=0; i<G[x].size(); ++i)
            if(!M[G[x][i]] || M[G[x][i]] > M[x]+1)
            {
                q.push(G[x][i]);
                M[G[x][i]]=M[x]+1;
            }
        q.pop();
    }
    for(i=1; i<=n; ++i)
        if(M[i]==0) printf("-1 ");
        else printf("%d ",M[i]-1);
    printf("\n");
    return 0;
}