#include <bits/stdc++.h>
#include <vector>
#include <fstream>
using namespace std;

vector<int> L[100001];
int dist[100001];

int m, n, s;

void bfs(int s) {
    for(int i = 1; i<= n; i++) {
        dist[i] = -1; // d[i] = distanta minima de la s la i daca nu se poate e -1
    }
    dist[s] = 0;
    queue<int> q;
    q.push(s);
    while(q.empty() == false) {
        int node = q.front();
        q.pop();
        for (auto vec : L[node]) {
            if(dist[vec] == -1) {
                dist[vec] = dist[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main() {
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        L[a].push_back(b);
        // asta dispare pt ca e orientat deci a e vec cu b dar nu invers - L[b].push_back(a);
    }
    bfs(s);
    for(int i = 1; i <= n; i++) {
        fout << dist[i] << ' ';
    }
}