#include <fstream>
#include <vector>
#include <queue>

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

int main() {
    int n, m, s;
    std::vector<int> v[100001];
    int dist[100001];
    fin >> n >> m >> s;
    int x, y;
    
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        v[x].push_back(y); 
    }
    for (int i = 1; i <= n; i++)
        dist[i] = -1;
    std::queue<int> q;
    dist[s] = 0;
    q.push(s);

    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int vecin : v[nod])
            if (dist[vecin] == -1) {
                dist[vecin] = dist[nod] + 1; 
                q.push(vecin);
            }
    }

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

    return 0;
}