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

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

const int INF = 2e9;
int n, m, S, dist[100005];
vector<int> g[100005];
queue<int> q;

int main()
{
    in >> n >> m >> S;
    for (int i = 1, x, y; i <= m; ++i) {
        in >> x >> y;
        g[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i) dist[i] = INF;
    dist[S] = 0;
    q.push(S);

    while (!q.empty()) {
        int x = q.front(); q.pop();
        for (int y : g[x]) {
            if (dist[x] + 1 < dist[y]) {
                dist[y] = dist[x] + 1;
                q.push(y);
            }
        }
    }

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


    return 0;
}