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

using namespace std;

int n, m, s, x, y;
vector<int> v[100005], dist(100005, 100005);
queue<int> q;

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

    f >> n >> m >> s;
    while(m) {
        f >> x >> y;

        v[x].push_back(y);
        m--;
    }
    f.close();

    q.push(s);
    dist[s] = 0;
    while(!q.empty()) {
        x = q.front();
        q.pop();
        for(y = 0; y < v[x].size(); y++)
            if(dist[x] + 1 < dist[v[x][y]]) {
                dist[v[x][y]] = dist[x] + 1;
                q.push(v[x][y]);
            }
    }
    for(x = 1; x <= n; x++)
        if(dist[x] == 100005)
            g << "-1 ";
        else
            g << dist[x] << ' ';
    g << '\n';
    g.close();

    return 0;
}