#include <bits/stdc++.h>
#define ll long long
#define NMAX 100005

using namespace std;

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

int n, m, start;

vector<int> dist(NMAX);
vector<int> edge[NMAX];
queue<int> q;

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

        for(int i = 0; i < edge[node].size(); i++) {
            int neighbour = edge[node][i];
            if(dist[neighbour] == -1) {
                dist[neighbour] = dist[node] + 1;
                q.push(neighbour);
            }
        }
    }
}

int main() {
    fin >> n >> m >> start;
    for(int i = 0; i <= n; i++)
        dist[i] = -1;
    for(int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        edge[x].push_back(y);
    }

    q.push(start);
    dist[start] = 0;
    bfs();

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