#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

using namespace std;

#define lim 100001




vector<int> G[lim];
int path[lim];
queue<int> q;
int N,M;

void bfs(int startNode)
{
    int currentNode;
    q.push(startNode);
    path[startNode] = 0;
    currentNode = startNode;
    while(!q.empty()) {

        currentNode = q.front();
        q.pop();
        for (auto nod: G[currentNode])
            if (path[nod] == -1)
            {
                path[nod] = path[currentNode] + 1;
                q.push(nod);
            }

    }

}

int main() {

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

    int x,y,S;
    fin>>N>>M>>S;

    for(int i = 1 ; i  <= M; i++)
    {

        fin>>x>>y;
        G[x].push_back(y);

    }

    for(int i = 1; i <= N ; i++)
        path[i] = -1;

    bfs(S);

    for(int i = 1; i <= N; i++)
       fout<<path[i]<<' ';

    fin.close();
    fout.close();
    return 0;
}