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

const int NMAX = 1e5;
vector<int> L[NMAX + 1]; //vector<vector<int>> L;
int dist[NMAX + 1];
int n, m, s;

void bfs(int node) {
    queue<int> q;
    for(int i = 1; i <= n; i++) {
        dist[i] = -1;
    }
    dist[node] = 0;
    q.push(node);
    while(!q.empty()) {
        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 cin("bfs.in");
    ofstream cout("bfs.out");
    
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        L[x].push_back(y);
        //L[y].push_back(x);
    }
    bfs(s);
    for(int i = 1; i <= n; i++) {
        cout << dist[i] << ' ';
    }
}