#include <cstdio>
#include <queue>
#include <vector>

#define Nmax 100005

using namespace std;

queue<int> Q;
vector<int> G[Nmax];
int N,M,X;
int DP[Nmax];

void Read()
{
    scanf("%d%d%d",&N,&M,&X);
    int a,b;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d",&a,&b);
        G[a].push_back(b);
    }
}

void BFS(int k)
{
    DP[k] = 1;
    Q.push(k);
    while(!Q.empty()){
        k = Q.front(); Q.pop();
        for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(DP[*it] == 0)
            {
                DP[*it] = DP[k] + 1;
                Q.push(*it);
            }
    }
    for(int i = 1; i <= N; ++i)
        if(DP[i])
            printf("%d ",DP[i] - 1);
        else
            printf("-1 ");

}

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

    Read();
    BFS(X);

    return 0;
}