#include<cstdio>
#include<vector>
#include<deque>

using namespace std;

const int NMAX = 100000+5;

void Read(),BFS(),Print();

int N,M,Source;
int Dist[NMAX];
vector<int> V[NMAX];
deque<int> Q;

int main()
{
    Read();
    BFS();
    Print();

    return 0;
}

void Read()
{
    int x,y;

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

    scanf("%d%d%d",&N,&M,&Source);

    for(; M; --M)
    {
        scanf("%d%d",&x,&y);
        V[x].push_back(y);
    }
}

void BFS()
{
    int x;
    vector<int>::iterator it;

    Q.push_back(Source);
    Dist[Source] = 1;

    while(!Q.empty())
    {
        x = Q.front();
        Q.pop_front();

        for(it = V[x].begin(); it != V[x].end(); it++)
            if(!Dist[*it])
            {
                Q.push_back(*it);
                Dist[*it] = Dist[x] + 1;
            }
    }
}

void Print()
{
    int i;

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