#include <bits/stdc++.h>
using namespace std;
#define NMAX 100001


class Task {
  public:
    void solve() {
        read_input();
        print_output(get_result());
    }

  private:
    int n, m, source;
    vector<int> lista_vecini[NMAX];

    void read_input() {
        ifstream in("bfs.in");
        in >> n >> m >> source;

        for (int i = 1; i <= m; ++i) {
            int x, y;
            in >> x >> y;

            lista_vecini[x].push_back(y);
        }

        in.close();
    }

    vector<int> get_result() {
        queue<int> q;
        vector<int> dist(n + 1, -1);

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

        q.push(source);
        dist[source] = 0;

        while (!q.empty()) {
            int nod = q.front();
            q.pop();
            for (auto vecin : lista_vecini[nod]) {
                if (dist[vecin] == -1) {
                    dist[vecin] = d[nod] + 1;
                    q.push(vecin);
                }
            }
        }

        return dist;
    }

    void print_output(vector<int> dist) {
        ofstream out("bfs.out");
        for (int i = 1; i < n; ++i) {
            out << dist[i] << " ";
        }
        out << dist[n] << "\n";

        out.close();
    }
};

 

int main() {
    Task *task = new Task();
    task->solve();
    delete task;
    return 0;
}