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

using namespace std;

const int MAXN = 10000; // suficient pentru N <= 10000
int n, m, s;
int d[MAXN];        // distanțe
int viz[MAXN];      // vizitat
vector<int> l[MAXN]; // lista de adiacență

void BFS(int s) {
    queue<int> q;
    q.push(s);
    viz[s] = 1;
    d[s] = 0;

    while (!q.empty()) {
        int x = q.front();
        q.pop();

        for (int y : l[x]) {
            if (!viz[y]) {
                q.push(y);
                viz[y] = 1;
                d[y] = d[x] + 1;
            }
        }
    }
}

void citire() {
    ifstream fin("bfs.in");
    fin >> n >> m >> s;

    for (int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        l[x].push_back(y); // graf orientat
    }
    fin.close();

    // inițializare
    for (int i = 1; i <= n; i++) {
        viz[i] = 0;
        d[i] = -1; // -1 pentru nodurile inaccesibile
    }
}

int main() {
    citire();
    BFS(s);

    ofstream fout("bfs.out");
    for (int i = 1; i <= n; i++) {
        fout << d[i] << " ";
    }
    fout.close();

    return 0;
}


// TIP See CLion help at <a
// href="https://www.jetbrains.com/help/clion/">jetbrains.com/help/clion/</a>.
//  Also, you can try interactive lessons for CLion by selecting
//  'Help | Learn IDE Features' from the main menu.