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

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

void bfs () {
    while (!q.empty()) {
        int k = q.front();
        q.pop();
        vis[k] = 1;
        for (auto x: v[k])
            if (vis[x] == 0) {
                q.push(x);  dist[x] = dist[k] + 1;
            }
    }
}

int main()
{
    f >> n >> m >> s;
    for (int i=1; i<=m; ++i) {
        f >> x >> y;
        v[x].push_back (y);
    }
    for (int i=1; i<=n; ++i)
        dist[i] = -1;

    dist[s] = 0;  q.push(s);
    bfs ();
    for (int i=1; i<=n; ++i)
        g << dist[i] << ' ';
    return 0;
}