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

typedef vector<int> VI;
typedef VI::iterator IT;

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

int n, m, nod;
VI g[100001];
vector<bool> s;
VI d;
queue<int> q;

void Read();
void BFS( int x );
void Write();

int main()
{
    Read();
    BFS( nod );
    Write();
    return 0;
}


void Read()
{
    fin >> n >> m >> nod;
    d.resize(n + 1);
    s.resize(n + 1);
    int x , y;
    for( int i = 0; i < m; ++i )
    {
        fin >> x >> y;
        if( x != y )
            g[x].push_back( y );
    }
}
void BFS( int x )
{
    int i;
    s[nod] = true;
    q.push( nod );
    while( !q.empty() )
    {
        i = q.front();
        q.pop();
        for( IT it = g[i].begin(); it != g[i].end(); ++it )
            if( !s[*it] )
            {
                s[*it] = true;
                q.push( *it );
                d[*it] = d[i] + 1;
            }
    }

}
void Write()
{
    for( size_t i = 1; i < d.size(); ++i )
        if( d[i] == 0 && i != nod )
            fout << "-1" << ' ';
        else
            fout << d[i] << ' ';
}