#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

#define nmax 1000050

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

vector <int> v[nmax];
priority_queue<int> cd;

int N, M, S, poz = 1, c, nr,Cost[nmax], ocupat[nmax];

int main()
{
    int i, x, y;
    f>>N>>M>>S;
    for(i = 1; i <= M; ++i){
        f>>x>>y;
        v[x].push_back( y );
    }

    cd.push(S);
    Cost[S] = 1;

    while (!cd.empty()) {
        int nod = cd.front();
        cd.pop();

        for (auto node : v[nod]) {
            if (!Cost[node]) {
                cd.push(node);
                Cost[node] = Cost[nod] + 1;
            }
        }
    }

    for(i = 1; i <= N; ++i){
        g<< Cost[i] - 1 <<' ';
    }
    return 0;
}