// https://goo.gl/fBmFxu
#include <bits/stdc++.h>

using namespace std;

#define NMAX        100009
#define MMAX        200009
#define kInf        (1 << 30)
#define kInfLL      (1LL << 60)
#define kMod        666013
#define edge pair<int, int>

// number of tests from "in"
int test_cnt = 1;
void clean_test();

// your global variables are here


// your solution is here
vector<int>G[NMAX];
int n, m, start;
int d[NMAX];
int x, y;

void solve() {
    cin >> n >> m >> start;

    for (int i = 1; i <= m; ++i) {
        cin >> x >> y;
        G[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i) {
        d[i] = kInf;
    }

    queue<int>q;
    q.push(start);
    d[start] = 0;
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (int i = 0; i < G[x].size(); ++i) {
            int nod = G[x][i];
            if (d[x] + 1 < d[nod]) {
                d[nod] = d[x] + 1;
                q.push(nod);
            }
        }
    }

    for (int i = 1; i <= n; ++i) {
        if (d[i] == kInf) {
            cout << "-1 ";
        } else {
            cout << d[i];
        }
    }
    if (test_cnt > 0) {
        clean_test();
    }
}


void clean_test() {
    // clean if needed
    for (int i = 1; i <= n; ++i) {
        G[i].clear();
    }
    memset(d, 0, sizeof(d));
}

int main() {
    // din cauza ca fac redirectari, salvez starea lui cin si cout
    auto cin_buff = cin.rdbuf();
    auto cout_buff = cout.rdbuf();

    // las liniile urmatoare daca citesc din fisier
    ifstream fin("bfs.in");
    cin.rdbuf(fin.rdbuf()); // save and redirect

    // las liniile urmatoare daca afisez in fisier
    ofstream fout("out");
    cout.rdbuf(fout.rdbuf()); // save and redirect


//     cin >> test_cnt;
    while (test_cnt--) {
        solve();
    }

    // restore pentru cin si cout
//    cin.rdbuf(cin_buff);
//    cout.rdbuf(cout_buff);

    return 0;
}