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

using namespace std;

const int NodMax = 100005;
const int MuchMax = 1000005;

queue < int > Q;
vector < int > G[MuchMax];
int rez[NodMax];
int N, M, S;

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 Solve()
{
    Q.push(S);

    rez[S] = 1;

    while(!Q.empty())
    {
        int nodc = Q.front();
        Q.pop();

        vector < int > ::iterator it;

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

    }
}

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

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

    Read();
    Solve();
    Print();
    return 0;
}