#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

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

const int NMAX = 100005;

int n,m,s;
int dist[NMAX];
queue<int> coada;
vector<int> muchii[NMAX];

void bfs(int nod)
{
    int nodcrt;

    coada.push(nod);

    while (!coada.empty()) {
        nodcrt = coada.front();
        for (unsigned int i = 0; i < muchii[nodcrt].size(); i++) {
            if (dist[muchii[nodcrt][i]] == -1) {
                coada.push(muchii[nodcrt][i]);
                dist[muchii[nodcrt][i]] = dist[nodcrt] + 1;
            }
        }
        coada.pop();
    }
}

int main() {

    int x,y;

    fin >> n >> m >> s;
    for (int i = 0; i < m; i++) {
        fin >> x >> y;
        muchii[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        dist[i] = -1;
    }

    dist[s] = 0;

    bfs(s);

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


    return 0;
}