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

using namespace std;

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

const int DIM = 100010;

int n, m, s, x, y;
int dist[DIM];
vector<int> l[DIM];

void bfs(int start) {
    queue<int> q;
    dist[start] = 0;
    q.push(start);
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto adjNode : l[node]) {
            if (dist[adjNode] == INT_MAX) {
                dist[adjNode] = dist[node] + 1;
                q.push(adjNode);
            }
        }
    }
}

int main() {
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        l[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        dist[i] = INT_MAX;
    bfs(s);

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

    return 0;
}