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

using namespace std;

const int NMax = 100005;
const int MMax = 1000005;

int N, M, S;
vector < int > G[MMax];
queue < int > Q;
int cost[NMax];

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

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

void BFS()
{
    Q.push(S);
    cost[S]=1;
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        vector < int > ::iterator it;

        for(it=G[x].begin(); it!=G[x].end(); ++it)
        {
            if(!cost[*it])
            {
                cost[*it]=cost[x]+1;
                Q.push(*it);
            }
        }
    }

    for(int i=1; i<=N; ++i)
        printf("%d ", cost[i]-1);
}

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

    Read();
    BFS();
    return 0;
}