#include<stdio.h>
#include<vector>
#include<queue>

using namespace std;

#define NMAX 100005

vector<int> graph[NMAX];
char viz[NMAX];
int n, dist[NMAX], m, source;

int main() {
    int a, b;
    
    scanf("%d%d%d", &n, &m, &source);    
    for(int i = 1; i <= m; i++) {
        scanf("%d%d", &a, &b);
        graph[a].push_back(b);
    }
    
    queue<int> bfs;
    bfs.push(source);
    viz[source] = 1;
    dist[source] = 0;
    
    while(!bfs.empty()) {
        int new_source = bfs.front();
        bfs.pop();
        
        for(auto vecin : graph[new_source]) {
            if(!viz[vecin]) {
                bfs.push(vecin);
                viz[vecin] = 1;
                dist[vecin] = dist[new_source] + 1;
            }
        }
    }
    
    for(int i = 1; i <= n; i++) {
        if(!viz[i]) {
            printf("-1 ");
        }
        else {
            printf("%d ", dist[i]);
        }
    }
    printf("\n");
    
    return 0;
}