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

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

const int maxN = 100005;
vector<int> adj[maxN];
int dist[maxN];

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

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

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

    queue<int> q;
    q.push(S);
    dist[S] = 0;

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

        for (int neighbor : adj[node]) {
            if (dist[neighbor] == -1) {
                dist[neighbor] = dist[node] + 1;
                q.push(neighbor);
            }
        }
    }

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

    return 0;
}