#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<vector<int>> grph = vector<vector<int>>(100001);
vector<bool> viz = vector<bool>(100001,false);
vector<int> d = vector<int>(100001, 0);
int count = 0;
void bfs(int x) {
queue<int> q;
q.push(x);
viz[x] = true;

    while (!q.empty()) {
        int k = q.front();
        q.pop();

        for (const auto &item: grph[k]) {
            if(viz[item] == false) {
                d[item] = d[k]+1;
                q.push(item);
                viz[item] = true;
            }

        }
    }

}





int main() {
    int n, m, s;
    fin >> n >> m >> s;

    for (int i = 0; i < m; ++i) {
        int x, y;
        fin >> x >> y;
        grph[x].push_back(y);
    }

    bfs(s);

    for (int i = 1; i <= n; i++) {
        fout << ((d[i]==0 && i!=s)? -1 : d[i] )<< " ";


    }

    return 0;
}