#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream f("bfs.in");
ofstream of("bfs.out");

vector< vector< int > > lista_adc;
queue< pair<int, int> > coada;
vector<int> d;
vector<bool> viz;
int n;

void bfs(int start) {
    coada.push( make_pair( start, 0 ) );
    viz[start] = 1;
    while( !coada.empty() ) {
        pair<int, int> nod = coada.front();
        coada.pop();

        d[nod.first] = nod.second;

        for(int j = 0; j < lista_adc[ nod.first ].size(); j++)
           if( !viz[ lista_adc[nod.first][j] ] ){
                coada.push( make_pair( lista_adc[nod.first][j], nod.second + 1 ) );
                viz[ lista_adc[nod.first][j] ] = 1;
           }
    }
}

int main()
{
    int k, i, j, m, s;
    f >> n >> m >> s;

    for(i = 0; i <= n; i++) {
       d.push_back( -1 );
       vector<int> a;
       lista_adc.push_back( a );
       viz.push_back( 0 );
    }

    for(k = 0; k < m; k++) {
        f >> i >> j;
        lista_adc[i].push_back( j );
    }

    bfs( s );

    for(i = 1; i <= n; i++)
        of << d[i] << " ";

    return 0;
}