#include <fstream>
#include <algorithm>
#include <queue>
#include <iostream>
#define NMAX 10000

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, a[NMAX][NMAX], marc[NMAX], cost[NMAX], start;

queue <int> q;

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

void bfs(int start) {
    int i, x;
    marc[start] = 1;
    cost[start] = 0;
    q.push(start);
    while (!q.empty()) {
        x = q.front();
        q.pop();
        // vizitam toti vecinii punctului scos din coada
        for (i = 1; i <= n; i++)
            if (a[x][i] == 1 and not marc[i]) {
                q.push(i); marc[i] = 1; cost[i] = cost[x] + 1;
            }
    }
}

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

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

int main() {
    citire();
    setcost();
    bfs(start);
    afiscost();
    fout.close();
    return 0;
}