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

const int kNmax = 100005;

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

int main() {
    int n, m, s, x, y;
    vector<int> adj[kNmax];

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

    vector<bool> visited(n + 1, 0);
    vector<int> distance(n + 1, -1);
    queue<int> q;

    visited[s] = 1;
    q.push(s);
    distance[s] = 0;

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

        for (auto i = adj[tmp].begin(); i != adj[tmp].end(); ++i) {
            if (!visited[*i]) {
                visited[*i] = true;
                distance[*i] = distance[tmp] + 1;
                q.push(*i);
            }
        }
    }

    for (int i = 1; i < distance.size(); ++i) {
        fout << distance[i] << " ";
    }

    return 0;
}