#include <bits/stdc++.h>
using namespace std;

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

vector<int> l[100001];
int dist[100001];
int n, m, s;

void bfs(int start) {
    queue<int> q;
    dist[start] = 0;
    q.push(start);

    while (!q.empty()) {
        int node = q.front();
        q.pop();

        for (auto vec : l[node]) {
            if (dist[vec] == -1) {
                dist[vec] = dist[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main()
{
    fin >> n >> m >> s;

    for (int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        l[a].push_back(b);  
    }

    for (int i = 1; i <= n; i++) {
        dist[i] = -1;
    }

    bfs(s);

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

    return 0;
}