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

using namespace std;

int n, m, s;
vector<vector<int>> lista;
vector<int> pasi;

void rezolvare() {
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin>>n>>m>>s;
    lista.resize(n + 1);
    pasi.assign(n + 1, -1);

    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        lista[x].push_back(y);
    }
    queue<int> q;

    q.push(s);
    pasi[s] = 0;

    while (!q.empty()) {
        int curent = q.front();
        q.pop();
        for (int i = 0; i < lista[curent].size(); i++) {
            int vecin = lista[curent][i];
            if (pasi[vecin] == -1) {
                pasi[vecin] = pasi[curent] + 1;
                q.push(vecin);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        fout << pasi[i] << " ";
    }
}

int main() {
    rezolvare();
    return 0;
}