#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

vector<int> muchii[100005], vizitat(100005, 0), dist(100005, -1);
deque<int> coada;

void bfs(int start) {
    coada.push_back(start);
    vizitat[start] = 1;
    dist[start] = 0;
    while(!coada.empty()) {
        int nc = coada.front();
        coada.pop_front();
        for(int i = 0; i < muchii[nc].size(); ++i)
            if(!vizitat[muchii[nc][i]]) {
                coada.push_back(muchii[nc][i]);
                vizitat[muchii[nc][i]] = 1;
                dist[muchii[nc][i]] = dist[nc]+1;
            }
    }
}

int main()
{
    int n, m, initial;
    in >> n >> m >> initial;

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

    bfs(initial);
    for(int i = 1; i <= n; ++i)
        out << dist[i] << ' ';
    return 0;
}