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

vector<int> v[100001];
int d[100001];
int n, m, s;
//vector<vector<int>> v;
//cin >> n
//v.resize(n, vector<int>())

void bfs() {
    for(int i = 1; i <= n; i++) {
        d[i] = 1e9;
    }
    d[s] = 0;
    queue<int> q;
    q.push(s);
    while(!q.empty()) {
        int node = q.front();
        q.pop();
        //for(auto vec : v[node]) {
        //}
        for(int i = 0; i < v[node].size(); i++) {
            int vec = v[node][i];
            if(d[vec] > d[node] + 1) {
                d[vec] = d[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;
        v[x].push_back(y);
        //+v[y].push_back(x) -> graf neorientat
    }
    bfs();
    for(int i = 1; i <= n; i++) {
        if(d[i] == 1e9) {
            d[i] = -1;
        }
        cout << d[i] << ' ';
    }
    

}