#include <bits/stdc++.h>
#define NMAX 100005
#define pb push_back

using namespace std;

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

vector < int > v[NMAX];
queue < int > q;
int dist[NMAX];

void dfs();

int main()
{
    int n, m, x, a, b, i;

    fin >> n >> m >> x;
    while ( m-- )
    {
        fin >> a >> b;
        v[a].pb ( b );
    }

    for ( i = 1; i <= n; i++ ) if ( i != x ) dist[i] = -1;

    q.push ( x );
    dfs();

    for ( i = 1; i <= n; i++ ) fout << dist[i] << ' ';

    return 0;
}

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

    while ( q.empty() == 0 )
    {
        x = q.front();
        q.pop();

        for ( it = v[x].begin(); it != v[x].end(); it++ ) if ( dist[*it] == -1 ) dist[*it] = dist[x] + 1, q.push ( *it );
    }
}