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

using namespace std;

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

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

void bfs(int start) {
    q.push(start);
    dist[start] = 0;
    while (!q.empty()) {
        int node = q.front();
        for (int i = 0; i < v[node].size(); i++) {
            if (dist[v[node][i]] == -1) {
                q.push(v[node][i]);
                dist[v[node][i]] = dist[node] + 1;
            }
        }
        q.pop();
    }
}

int main() {
    fin >> n >> m >> s;
    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;
    bfs(s);

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

    return 0;
}