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

const int NMAX = 1e5;
const int INF = 1e9;
vector<int> L[NMAX + 1];
int d[NMAX + 1];
int n, m, s;

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