# include <fstream>
# include <algorithm>
# include <vector>
# include <queue>
# include <cstring>
# include <climits>
# include <set>

using namespace std;

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

int n, m, x;
bool v[100005];
vector < vector < int > > A;

void citire() {

    f >> n >> m >> x;
    A = vector < vector < int > > ( n + 1 );
    for ( int i = 0; i < m; ++ i ) {
        int a, b; f >> a >> b;
        A[a].push_back( b );
    }
}

vector < int > BFS( int start ) {

    for ( int i = 0; i <= n; ++ i ) {
        v[i] = 0;
    }
    queue < int > q;
    vector < int > dist( n + 1, -1 );
    v[start] = 1;
    int distanta = 0;
    dist[start] = 0;
    q.push( start );
    while ( !q.empty() ) {
        int k = q.front(); q.pop();
        distanta = dist[k] + 1;
        for ( auto it: A[k] ) {
            if ( v[it] == 0 && it != k ) {
                v[it] = 1;
                dist[it] = distanta;
                q.push( it );
            }
        }
    }

    return dist;

}

void solve() {

    vector < int > dist = BFS( x );
    for ( int i = 1; i <= n; ++ i ) {
        g << dist[i] << " ";
    }
}

int main()
{
    citire();
    solve();

    return 0;
}