#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>

using namespace std;

constexpr int kMaxN = 100000, kMaxM = 1000000;

int degree[kMaxN];
pair<int, int> vertex[kMaxM];
int* adj[kMaxN];
int dist[kMaxN], bfq[kMaxN];

int main() {
    #ifdef INFOARENA
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    #endif
    
    int n, m, s; cin >> n >> m >> s; s -= 1;
    
    for (int i = 0; i < m; i += 1) {
        int x, y; cin >> x >> y; x -= 1; y -= 1;
        degree[x] += 1;
        vertex[i] = make_pair(x, y);
    }
    
    for (int i = 0; i < n; i += 1) {
        adj[i] = new int[degree[i]];
        degree[i] = 0;
    }
    
    for (int i = 0; i < m; i += 1) {
        const int x = vertex[i].first, y = vertex[i].second;
        adj[x][degree[x]++] = y;
    }
    
    int q_start = 0, q_end = 1;
    dist[s] = 1;
    bfq[0] = s;
    while (q_start != q_end) {
        const int node = bfq[q_start++];
        for (int i = 0; i < degree[node]; i += 1) {
            const int son = adj[node][i];
            if (dist[son] == 0) {
                dist[son] = dist[node] + 1;
                bfq[q_end++] = son;
            }
        }
    }
    
    for (int i = 0; i < n; i += 1) {
        cout << dist[i] - 1 << " \n"[i == n - 1];
    }
}