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

using namespace std;

#define INF 0x3f3f3f3f

map<int, vector<int> > graf;

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

int costs[100005];
int visited[100005];

int main() {
    int count=0, n, m, s, start, end, components=0;
    queue<int> q;

    fin >> n >> m >> s;

    count = 1;
    while (count <= n) {
        vector<int> vecini;
        graf[count] = vecini;
        costs[count] = INF;
        ++count;
    }

    count = 0;
    while (count < m) {
        fin >> start >> end;

        graf[start].push_back(end);

        ++count;
    }

    q.push(s);
    costs[s] = 0;
    visited[s] = 1;

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

        for (auto &vecin: graf[node]) {
            if (costs[vecin] > costs[node] + 1 && !visited[vecin]) {
                visited[node] = 1;
                costs[vecin] = costs[node] + 1;
                q.push(vecin);
            }
        }
    }

    for(int index=1; index <= n; index++) {
        if (costs[index] == INF)
            fout << -1 << " ";
        else
            fout << costs[index] << " ";
    }

    return 0;
}