#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <memory.h>

#define Nmax 100005

using namespace std;
queue<int> Q;
vector<int> G[Nmax];
int dist[Nmax],N,M,S;


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

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

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

    memset(dist,-1,sizeof(dist));

    read();
    BFS(S);

    return 0;
}