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

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

vector<int> liste[100001];
int viz[100001], n, m, x, y, s;

int main()
{

    in >> n >> m >> s;

    for( int i=1; i<=n; i++ )
        viz[i] = -1;

    viz[s] = 0;

    for( int i=1; i<=m; i++ )
    {
        in >> x >> y;
        liste[x].push_back(y);
    }

    queue<int> q;

    q.push(s);

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

        for( vector<int>::iterator it=liste[x].begin(); it!=liste[x].end(); it++ )
            if( viz[*it] == -1 )
            {
                q.push(*it);
                viz[*it] = viz[x] + 1;
            }
    }

    for( int i=1; i<=n; i++ )
        out << viz[i] << " ";

    return 0;
}