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

using namespace std;

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

const int MAXN = 100005;
vector<int> D[MAXN];
int dist[MAXN];
int n, m, start;

void bfs(int start){
    queue<int> q;

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

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

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

        for (int v : D[u]){
            if (dist[v] == -1){
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
}


int main(){

    fin >> n >> m >> start;

    for (int i = 1; i <= m; i++){
        int u ,v;
        fin >> u >> v;
        D[u].push_back(v);
    }

    bfs(start);

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

}