#include <bits/stdc++.h>
using namespace std;

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

void BFS(int s, vector<vector<int>> &lista, vector<int> &distante, queue<int> &q, vector<bool> &vizitate) {
    q.push(s);
    vizitate[s] = true;
    distante[s] = 0;

    while (!q.empty()) {
        int elem = q.front();
        q.pop();
        
        for (int i = 0; i < lista[elem].size(); i++) {
            int curr = lista[elem][i];
            if (vizitate[curr])
                continue;
            q.push(curr);
            vizitate[curr] = true;
            distante[curr] = distante[elem] + 1;
        }
    }
}

int main() {
    int n, m, s;
    f >> n >> m >> s;
    vector<int> distante(n + 1, -1);
    vector<bool> vizitate(n + 1);
    queue<int> q;
    vector<vector<int>> lista(n + 1);

    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        lista[x].push_back(y);
    }

    BFS(s, lista, distante, q, vizitate);
    for (int i = 1; i <= n; i++)
        g << distante[i] << " ";

    f.close();
    g.close();
    return 0;
}