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

using namespace std;

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

const int MAXN = 100005;

vector<int> L[MAXN];
int D[MAXN];

int main() {
    int n, m, start;
    fin >> n >> m >> start;

    for (int i = 1; i <= m; ++i) {
        int u, v;
        fin >> u >> v;
        L[u].push_back(v);
    }

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

    queue<int> q;

    D[start] = 0;
    q.push(start);

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

        for (int vec : L[nod]) {
            if (D[vec] == -1) {
                D[vec] = D[nod] + 1;
                q.push(vec);
            }
        }
    }

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

    return 0;
}