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

vector<int> bfs(int n, int s, const vector<vector<int>> &adj)
{
    vector<int> dist(n+1, -1);
    queue<int> q;

    q.push(s);
    dist[s] = 0;

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

        for (auto vecin : adj[v]) {
            if (dist[vecin] == -1) {
                dist[vecin] = dist[v] + 1;
                q.push(vecin);
            }
        }
    }

    return dist;
}

int main(){
    std::ifstream fin("bfs.in");
    std::ofstream fout("bfs.out");

    int n, m, s;
    fin >> n >> m >> s;

    vector<vector<int>> adj(n+1);

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

    auto rezultat = bfs(n, s, adj);

    for (int i = 1; i <= n; ++i)
        fout << rezultat[i] << ' ';
    fout << endl;
}