#include <fstream>
using namespace std;

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

int graph[100001][100001], dist[100001];

void bfs(int node, int n, int nr) {
    dist[node] = nr;

    for (int i = 1; i <= graph[node][0]; i++)
        if (dist[graph[node][i]] == -1 || dist[graph[node][i]] > nr) //sa ma gandesc ce fac daca nu am muchie i i...
            bfs(graph[node][i], n, nr + 1);
}

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

    for (int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        graph[x][++graph[x][0]] = y;
    }

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

    bfs(node, n, 0);

    /*for (int i = 1; i <= n; i++) {
        fout << i << " -> ";
        for (int j = 1; j <= graph[i][0]; j++)
            fout << graph[i][j] << " ";
        fout << "\n";
    }*/

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

    return 0;
}