#include<cstdio>
#include<vector>
#include<queue>
#define MAX_N 100000
using namespace std;

vector<int>g[MAX_N+1];
queue<int>q;
int dist[MAX_N+1], n, m, S;

void readGraph() {
    int i, x, y;
    FILE* fin = fopen("bfs.in","r");
    fscanf(fin,"%d%d%d",&n,&m,&S);
    for(i = 0; i < m; i++) {
        fscanf(fin,"%d%d",&x,&y);
        g[x].push_back(y);
    }
    fclose(fin);
}

void BFS(int source) {
    int i, node;
    for(i = 1; i <= n; i++)
        dist[i] = -1;
    dist[source] = 0;
    q.push(source);
    while(!q.empty()) {
        node = q.front();
        q.pop();
        for(auto i : g[node]) {
            if(dist[i] == -1) {
                dist[i] = 1 + dist[node];
                q.push(i);
            }
        }
    }
}

void printDistances() {
    FILE* fout = fopen("bfs.out","w");
    for(int i = 1; i <= n; i++)
        fprintf(fout,"%d ",dist[i]);
    fprintf(fout,"\n");
    fclose(fout);
}

int main() {
    readGraph();
    BFS(S);
    printDistances();
    return 0;
}