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

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

const int nlim = 100005;
vector < int > muchii[nlim];

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

int distanta[nlim];
queue < int > coada;
void bfs() {
    int nod, vecin;
    while (!coada.empty()) {
        nod = coada.front();
        coada.pop();
        for (unsigned i = 0; i < muchii[nod].size(); ++i) {
            vecin = muchii[nod][i];
            if (distanta[vecin] == -1) {
                coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }
    }
}

void setare_distante() {
    for (int i = 1; i <= n; ++i)
        distanta[i] = -1;
    distanta[s] = 0;

    coada.push(s);
    bfs();
}

void afisare() {
    for (int i = 1; i <= n; ++i)
        fout << distanta[i] << ' ';
}

int main() {
    citire();
    setare_distante();
    afisare();
}