#include <vector>
#include <fstream>

using namespace std;

vector <int> G[100100];
int d[100100], q[100100];

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

    int n, m, x;
    fin >> n >> m >> x;
    for (int i = 1; i <= m; ++i) {
        int nod1, nod2;
        fin >> nod1 >> nod2;
        G[nod1].push_back(nod2);
    }
    for (int i = 1; i <= n; ++i)
        d[i] = -1;
    d[x] = 0;
    int p = 1, u = 0;
    q[++u] = x;
    while (p <= u) {
        int nod = q[p];
        for (int i = 0; i < G[nod].size(); ++i) {
            int nod2 = G[nod][i];
            if (d[nod2] == -1) {
                d[nod2] = d[nod] + 1;
                q[++u] = nod2;
            }
        }
        ++p;
    }
    for (int i = 1; i <= n; ++i)
        fout << d[i] << " ";
    return 0;
}