#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

#define NMAX 100005

vector<int> G[NMAX];
queue<int> Q;
int dist[NMAX];

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

    dist[start] = 0;
    Q.push(start);
    while (Q.size()) {
        int nod = Q.front();
        Q.pop();

        for (auto it : G[nod]) {
            if (dist[it] == -1) {
                dist[it] = dist[nod] + 1;
                Q.push(it);
            }
        }
    }
}

int main() {
    int n, m, s;
    fin >> n >> m >> s;
    while (m--) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }

    bfs(s, n);

    for (int i = 1; i <= n; ++i) {
        fout << dist[i] << ' ';
    }
    return 0;
}