#include <iostream>
#include <vector>
#include <queue>
#include <stdio.h>

#define Nmax 100005

using namespace std;

vector<int> G[Nmax];
queue<int> Q; ///coada

int n, m, s;
int pas[Nmax];

void citire()
{
    freopen("bfs.in", "r", stdin);

    int x, y;

    scanf("%d %d %d\n", &n, &m, &s);
    for(int i=0; i<m;++i)
    {
        scanf("%d %d\n", &x, &y);
        G[x].push_back(y);
    }
}

void parcurgere()
{
    Q.push(s);
    pas[s] = 1;
    while(!Q.empty())
    {
        int p = Q.front();
        Q.pop();

        for(vector<int>::iterator it = G[p].begin(); it != G[p].end(); ++it)
        {
            if(pas[*it] == 0)
            {
                pas[*it] = pas[p]+1;
                Q.push(*it);
            }
        }
    }
}

void afisare()
{
    for(int i = 1;i<=n;++i)
        printf("%d ", pas[i]-1);
}

int main()
{
    citire();
    parcurgere();
    afisare();

    return 0;
}